References
- WangMYSethiSPVan De VeldeSLMinimizing makespan in a class of reentrant shopsOpns Res19974570271210.1287/opre.45.5.702
- Vargas-VillamilFDRiveraDEA model predictive control approach for real-time optimization of reentrant manufacturing linesComput Ind200145455710.1016/S0166-3615(01)00080-X
- BispoCFTayurSManaging simple re-entrant flow lines: theoretical foundation and experimental resultsIIE Trans200133609623
- UzsoyRLeeCYMartin-VegaLAA review of production planning and scheduling models in the semiconductor industry—Part 1: system characteristics, performance evaluation and production planningIIE Trans199224476010.1080/07408179208964233
- BenguGA simulation-based scheduler for flexible flowlinesInt J Prod Res19943232134410.1080/00207549408956936
- KubiakWLouSXCWangYMean flow time minimization in reentrant job-shops with a hubOpns Res19964476477610.1287/opre.44.5.764
- PinedoMScheduling: Theory, Algorithms, and Systems1995
- WagnerHMAn integer linear-programming model for machine schedulingNaval Res Logist Q1959613114010.1002/nav.3800060205
- WilsonJMAlternative formulations of a flow-shop scheduling problemJ Opl Res Soc19894039539910.1057/jors.1989.58
- ManneASOn the job-shop scheduling problemOpns Res1960821922310.1287/opre.8.2.219
- PanCHA study of integer programming formulations for scheduling problemsInt J Syst Sci199728334110.1080/00207729708929360
- BowmanEHThe scheduling-sequence problemOpns Res1959762162410.1287/opre.7.5.621
- MortenTEPenticoDWHeuristic Scheduling Systems1993
- CoffmanEGComputer and Job Shop Scheduling1976
- Rinnooy KanAHGMachine Scheduling Problems: Classification, Complexity and Computations1976
- PalmerDSSequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimumOpl Res Q19651610110710.1057/jors.1965.8
- CampbellHGDudekRASmithMLA heuristic algorithm for the n job, m machine sequencing problemMngt Sci197016B630B63710.1287/mnsc.16.10.B630
- GuptaJNDA functional heuristic algorithm for the flowshop scheduling problemOpl Res Q197122394710.1057/jors.1971.18
- DannenbringDGAn evaluation of flow shop sequencing heuristicsMngt Sci1977231174118210.1287/mnsc.23.11.1174
- NawazMEnscoreEEHamIA heuristic algorithm for the m-machine n-job flow-shop sequencing problemOmega198311919510.1016/0305-0483(83)90088-9
- FrenchSSequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop1982
- SuleDRIndustrial Scheduling1997
- JohnsonSMOptimal two- and three-stage production schedules with set up times includedNaval Res Logist Q19541616810.1002/nav.3800010110
- (1999). LINGO: User's Guide. LINDO Systems Inc.: Chicago, IL.