References
- GonzalezTSahniSFlow shop and job shop schedulesOps Res197826365210.1287/opre.26.1.36
- Della CroceFNarayanVTadeiRThe two-machine total completion time flow shop problemEur J Opl Res19969022723710.1016/0377-2217(95)00351-7
- AllahverdiAMinimizing mean flowtime in a two-machine flowshop with sequence independent setup timesComput Ops Res20002711112710.1016/S0305-0548(99)00010-6
- RajendranCZieglerHAn efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobsEur J Opl Res199710312913810.1016/S0377-2217(96)00273-1
- WooHSYimDSA heuristic algorithm for mean flowtime objective in flowshop schedulingComput Ops Res19982517518210.1016/S0305-0548(97)00050-6
- AllahverdiAAldowaisanTNew heuristics to minimize total completion time in m-machine flowshopsInt J Product Econ200277718310.1016/S0925-5273(01)00228-6
- KamburowskiJStochastically minimizing the makespan in two-machine flow shops without blockingEur J Opl Res199911230430910.1016/S0377-2217(97)00424-4
- ElmaghrabySThoneyKATwo-machine flowshop problem with arbitrary processing time distributionsIIE Trans200031467477
- AllahverdiAStochastically minimizing total flowtime in flowshops with no waiting spaceEur J Opl Res199911310111210.1016/S0377-2217(97)00438-4
- AllahverdiAMittenthalJTwo-machine ordered flowshop scheduling under random breakdownsMath Comput Modelling19942091710.1016/0895-7177(94)90202-X
- LawlerELLenstraJKRinnooy KanAHGShmoysDBSequencing and scheduling: algorithms and complexityHandbooks in Operations Research and Management Science, 4: Logistics of Production and Inventory1993445522
- TanaevVSSotskovYNStrusevichVAScheduling Theory: Multi-Stage Systems1994
- IshiiHMasudaTNishidaTTwo machine mixed shop scheduling problems with controllable machine speedsDiscrete Appl Math198717293810.1016/0166-218X(87)90005-9
- JaniakAGeneral flow-shop scheduling with resource constraintsInt J Product Res19882612513810.1080/00207548808947920
- StrusevichVATwo machine flow shop scheduling problem with no wait in process: Controllable machine speedsDiscrete Appl Math199559758610.1016/0166-218X(93)E0153-P
- LeiLWangTJThe minimum common-cycle algorithm for cycle scheduling of two hoists with time window constraintsMngt Sci1991371629163910.1287/mnsc.37.12.1629
- ChenHChuCProthJMCyclic scheduling of a hoist with time window constraintsIEEE Trans Robotics Automat19981414415210.1109/70.660860
- LaiTCSotskovYNSotskovaNYWernerFOptimal makespan scheduling with given bounds of processing timesMath Comput Modelling1997266786
- LaiTCSotskovYNSequencing with uncertain numerical data for makespan minimizationJ Opl Res Soc19995023024310.1057/palgrave.jors.2600690
- Lai TC, Sotskov YN, Sotskova NY and Werner F . Mean flow time minimization with given bounds of processing times. Eur J Opl Res., in press.
- AllahverdiASotskovYNTwo-machine flowshop minimum-length scheduling problem with random and bounded processing timesInt Trans Opl Res200310657610.1111/1475-3995.00393
- KuPSNiuSCOn Johnson's two-machine flow shop with random processing timesOps Res19863413013610.1287/opre.34.1.130
- PinedoMScheduling: Theory, Algorithms, and Systems1995
- AkersSBFriedmanJA non-numerical approach to production scheduling problemsOps Res19553429442
- SzwarcWSolution of the Akers–Friedman scheduling problemOps Res1960878278810.1287/opre.8.6.782
- HardgraveWWNemhauserGA geometric model and graphical algorithm for a sequencing problemOps Res19631188990010.1287/opre.11.6.889
- BruckerPAn efficient algorithm for the job-shop problem with two jobsComputing19884035335910.1007/BF02276919
- Sotskov YN (1985). Optimal scheduling two jobs with regular criterion. Design Processes Automating: 86–95 (in Russian).
- SotskovYNThe complexity of shop-scheduling problems with two or three jobsEur J Opl Res19915332633610.1016/0377-2217(91)90066-5