References
- GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimisation and approximation in deterministic sequencing and scheduling: a surveyAnn Disc Math1979528732610.1016/S0167-5060(08)70356-X
- LawlerELSequencing and scheduling: algorithms and complexityHandbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory1993455522
- JohnsonSMOptimal two- and three-stage production scheduling with set-up times includedNaval Res Logist Q19541616810.1002/nav.3800010110
- YoshidaTHitomiKOptimal two-stage production scheduling with set-up times separatedAIIE Trans19791126126310.1080/05695557908974469
- StrusevichVAZwaneveldCMOn non-permutation solutions to some two-machine flowshop scheduling modelsZ Opns Res199439305319
- GilmorePCGomoryRESequencing a one-state variable machine: a solvable case of the traveling salesman problemOpns Res19641266567910.1287/opre.12.5.655
- GarfinkelRSMotivation and modelingThe Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization19861736
- PiehlerJEin Beitrag zum ReinhenfolgeproblemUnternehmensforschung19604138142
- RöckJThe three-machine no-wait flow-shop problem is NP-completeJ Assoc Comput Mach19843133634510.1145/62.65
- PapadimitriouCKanellakisPFlowshop scheduling with limited temporary storageJ Assoc Comput Mach19802753354910.1145/322203.322213
- AllahverdiAGuptaJNDAldowiasanTAA review of scheduling research involving set-up considerationsOMEGA19992721923910.1016/S0305-0483(98)00042-5
- HallNGSriskandarajahCA survey of machine scheduling problems with blocking and no-wait in processOpns Res19964451052510.1287/opre.44.3.510
- GonzalezTSahniSFlow shop and job shop schedulesOpns Res197826365210.1287/opre.26.1.36
- AldowaisanTAAllahverdiATotal flowtime in no-wait flowshops with separated set-up timesComput Opns Res19982575776510.1016/S0305-0548(98)00002-1
- AllahverdiAMinimizing mean flowtime in a two-machine flowshop with sequence-independent set-up timesComput Opns Res20002711112710.1016/S0305-0548(99)00010-6
- FoxKRGavishBGravesSCAn n-constraint formulation of the (time-dependent) traveling salesman problemOpns Res1980281018102110.1287/opre.28.4.1018
- LinSKernighanBWAn effective heuristic algorithm for the traveling-salesman problemOpns Res19732149851610.1287/opre.21.2.498
- HelsgaunKAn effective implementation of the Lin–Kernighan traveling salesman heuristicEur J Opl Res200012610613010.1016/S0377-2217(99)00284-2
- BentnerJOptimization of the time-dependent traveling salesman problem with Monte Carlo methodsPhys Rev E2001641810.1103/PhysRevE.64.036701