References
- JohnsonSMOptimal two- and three-stage production schedules with set-up times includedNav Res Log Q19541616810.1002/nav.3800010110
- GuptaJNDA review of flowshop scheduling researchDisaggregation: Problems in Manufacturing and Service Organizations1979363387
- ChenBPottsCNWoegingerGJA review of machine scheduling: complexity, algorithms and applicationsHandbook of Combinatorial Optimization199821169
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
- LawlerELLenstraJKRinnooy KanAHGShmoysDBSequencing and scheduling: algorithms and complexityLogistics of Production and Inventory1993445522
- WagnerHMAn integer linear-programming model for machine schedulingNav Res Log Q1959613114010.1002/nav.3800060205
- BowmanEHThe schedule-sequence problemOpns Res1959762162410.1287/opre.7.5.621
- ManneASOn the job-shop scheduling problemOpns Res1960821922310.1287/opre.8.2.219
- BakerKRIntroduction to Sequencing and Scheduling1974
- StaffordEFOn the development of a mixed-integer linear programming model for the flowshop sequencing problemJ Opl Res Soc1988391163117410.1057/jors.1988.193
- StaffordEFA mixed-integer linear programming model for the classical flowshop sequencing problem1983
- StaffordEFTsengFTTwo models for a family of flowshop sequencing problemsEur J Opnl Res200214228229310.1016/S0377-2217(01)00320-4
- WilsonJMAlternative formulations of a flow-shop scheduling problemJ Opl Res Soc19894039539910.1057/jors.1989.58
- TsengFTStaffordEFTwo MILP models for the N × M SDST flowshop sequencing problemInt J Prod Res2001391777180910.1080/00207540010029433
- StaffordEFTsengFTOn the Srikar–Ghosh MILP model for the N × M SDST flowshop problemInt J Prod Res1990281817183010.1080/00207549008942836
- LiaoCLYouCTAn improved formulation for the job-shop scheduling problemJ Opl Res Soc1992431047105410.1057/jors.1992.162
- PanCHA study of integer programming formulations for scheduling problemsInt J Sys Sci199728334110.1080/00207729708929360
- MortenTEPenticoDWHeuristic Scheduling Systems1993
- SCICONICIVM User Guide (1986). Scicon Limited: London.
- StaffordEFGuptaJNDTsengFTSupplemental materials for a study of flowshop scheduling models2004
- StaffordEFTsengFTOn ‘redundant’ constraints in Stafford's MILP model for the flowshop problemJ Opl Res Soc2003541104110710.1057/palgrave.jors.2601615
- LiaoCLMinimizing the number of machine idle intervals with minimum makespan in a flowshopJ Opl Res Soc19934481782410.1057/jors.1993.140
- SrikarBNGhoshSA MILP model for the—job-stage flowshop with sequence dependent set-up timesInt J Prod Res1986241459147410.1080/00207548608919815
- Stafford EF and Tseng FT (2001). Two MILP models for the SSIST flowshop sequencing problem. In: Rungtusanatham MJ (ed). 2001 Decision Sciences Institute Proceedings. Decision Sciences Institute, Atlanta, GA, pp. 1010–1012.
- ILOG SAILOG CPLEX 7.1 User's Manual2001
- LINDO Systems Inc. (1999). LINDO Users Manual. LINDO Systems Inc.: Chicago.
- LINDO Systems, Inc. (1999). LINGO User's Guide. LINDO Systems Inc.: Chicago.
- IBM (1979). Mathematical Programming System Extended/370 Program Reference Manual. IBM: Paris, France.
- TsengFTStaffordEFGuptaJNDAn empirical analysis of integer programming formulations for the permutation flowshopOMEGA: In J Mngt Sci20033228529310.1016/j.omega.2003.12.001
- HollanderMWolfeDANonparametric Statistical Methods1973
- LINDO Systems Inc. (2001). LINDO Callable Library User's Manual. LINDO Systems Inc.: Chicago.
- AggarwalSCStaffordEFA heuristic algorithm for the flowshop problem with a common job sequence on all machinesDec Sci1975623725110.1111/j.1540-5915.1975.tb01016.x
- Rios-MercadoRZBardJFComputational experience with a branch-and-cut algorithm for flowshop scheduling with setupsComp and Opns Res19982535136610.1016/S0305-0548(97)00079-8
- LagewegBJA general bounding scheme for the permutation flow-shopOpns Res19782662162410.1287/opre.26.1.53
- CampbellHGDudekRASmithMLA heuristic algorithm for the n job M machine sequencing problemMngt Sci197016B630B63710.1287/mnsc.16.10.B630