References
- BakerKRIntroduction to Sequencing and Scheduling1974
- BouquardJ-LLentéCTwo-machine flow shop scheduling problems with minimal and maximal delays, 4ORQuart J Opns Res200641528
- BouquardJ-LLentéCBillautJ-CApplication of an optimization problem in Max-Plus algebra to scheduling problemsDiscrete Appl Math20061542064207910.1016/j.dam.2005.04.011
- ChengTCEGuptaJNDWangGA review of flowshop scheduling research with setup timesProd Opns Mngt20009283302
- ChoiS-WKimY-DMinimizing makespan on a two-machine re-entrant flowshopJ Opl Res Soc20075897298110.1057/palgrave.jors.2602220
- ChoiYSLeeSSKimSHA heuristic m-machine flowshop scheduling method under the total tardiness criterionJ Korean Inst Indust Eng199218191104
- CorwinBBEsogbueAOTwo-machine flowshop scheduling problems with sequence dependent setup times: A dynamic programming approachNaval Res Logistics Quart19742151552410.1002/nav.3800210311
- FraminanJMGuptaJNDLeistenRA review and classification of heuristics for permutation flow-shop scheduling with makespan objectiveJ Opl Res Soc2004551243125510.1057/palgrave.jors.2601784
- FondrevelleJOulamaraAPortmannM-CPermutation flowshop scheduling problems with maximal and minimal time lagsComput Opns Res2006331540155610.1016/j.cor.2004.11.006
- GilmorePCGomoryRESequencing a one state-variable machine: A solvable case of the traveling salesman problemOpns Res19641265567910.1287/opre.12.5.655
- GuptaJNDA general algorithm for the n × m flowshop scheduling problemInt J Prod Res1969724124710.1080/00207546808929814
- GuptaJNDAn improved combinatorial algorithm for the flowshop scheduling problemOpns Res1971191753175810.1287/opre.19.7.1753
- GuptaJNDOptimal scheduling in a multi-stage flowshopAIIE Trans1972423824310.1080/05695557208974856
- GuptaJNDStaffordEFJr.Flowshop scheduling research after five decadesEur J Opl Res200616969971110.1016/j.ejor.2005.02.001
- IgnallESchrageLApplication of branch-and-bound technique to some flow shop problemsOpns Res19651340041210.1287/opre.13.3.400
- JohnsonSMOptimal two- and three-stage production schedules with setup times includedNaval Res Logistics Quart19541616810.1002/nav.3800010110
- KimY-DA new branch and bound algorithm for minimizing mean tardiness in two-machine flowshopsComput Opns Res19932039140110.1016/0305-0548(93)90083-U
- KimY-DHeuristics for flowshop scheduling problems minimizing mean tardinessJ Opl Res Soc199344192810.1057/jors.1993.3
- KimY-DMinimizing total tardiness in permutation flowshopsEur J Opl Res19958554155110.1016/0377-2217(94)00029-C
- KimY-DLimH-GParkM-WSearch heuristics for a flowshop scheduling problem in a printed circuit board assembly processEur J Opl Res19969112414310.1016/0377-2217(95)00119-0
- LagewegBJLenstraJKRinnooy KanAHGA general bounding scheme for the permutation flow-shop problemOpns Res197826536710.1287/opre.26.1.53
- NawazMEnscoreEEHamIA heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega198311919510.1016/0305-0483(83)90088-9
- SuL-HA hybrid two-stage flowshop with limited waiting time constraintsComput Indust Eng20034440942410.1016/S0360-8352(02)00216-4
- SzwarzWOptimal elimination methods in the m×n flowshop scheduling problemsOpns Res1973211250125910.1287/opre.21.6.1250
- WooH-SYimD-SLeeW-KA heuristic algorithm for mean flowtime minimization in permutation flowshop schedulingJ Korean Inst Indust Eng199622115127
- YangD-LChernM-SA two-machine flowshop sequencing problem with limited waiting time constraintsComput Indust Eng199528637010.1016/0360-8352(94)00026-J