References
- AllahverdiAGuptaJNDAldowaisanTA review of scheduling research involving setup considerationsOmega—Int J Manage Sci19992721923910.1016/S0305-0483(98)00042-5
- AllahverdiANgCTChengTCEKovalyovMYA survey of scheduling problems with setup times or costsEur J Opl Res2008187985103210.1016/j.ejor.2006.06.060
- AllahverdiASoroushHMThe significance of reducing setup times/setup costsEur J Opl Res200818797898410.1016/j.ejor.2006.09.010
- BakerKRHeuristic procedures for scheduling job families with setups and due datesNav Res Log19994697899110.1002/(SICI)1520-6750(199912)46:8<978::AID-NAV7>3.0.CO;2-D
- BakerKRMagazineMJMinimizing maximum lateness with job familiesEur J Opl Res200012712613910.1016/S0377-2217(99)00328-8
- ChenBPottsCNWoegingerGJA review of machine scheduling: complexity, algorithms and applicationsHandbook of Combinatorial Optimization199821169
- ChengTCENgCTYuanJJThe single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hardJ Sched2003648349010.1023/A:1024858623282
- GhoshJBGuptaJNDBatch scheduling to minimize maximum latenessOpns Res Lett199721778010.1016/S0167-6377(97)00028-X
- HaririAMAPottsCNSingle machine scheduling with batch setup times to minimize maximum latenessAnn Opns Res199770759210.1023/A:1018903027868
- LawlerELLenstraJKRinnooy KanAHGShmoysDBSequencing and scheduling: Algorithms and complexityHand-books in Operations Research and Management Science 4, Logistics of Production and Inventory1993445524
- LuLFYuanJJThe single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hardEur J Opl Res20071771302130910.1016/j.ejor.2005.12.027
- MonmaCLPottsCNOn the complexity of scheduling with batch setup timesOpns Res19893779880410.1287/opre.37.5.798
- NowickiEZdrzałkaSSingle machine scheduling with major and minor setup times: a tabu search approachJ Opl Res Soc1996471054106410.1057/jors.1996.132
- PottsCNKovalyovMYScheduling with batching: a reviewEur J Opl Res200012022824910.1016/S0377-2217(99)00153-8
- SchultzSRHodgsonTJKingRETanerMRMinimizing L-max for the single machine scheduling problem with family set-upsInt J Prod Res2004424315433010.1080/00207540410001716561
- SchuttenJMJVan de ValdeSLZijmWHMSingle machine scheduling with release dates, due-dates and family setup timesMngt Sci1996421165117410.1287/mnsc.42.8.1165
- UnalATKiranASBatch sequencingIIE Trans199224738310.1080/07408179208964235
- UzsoyRVelasquezJDHeuristics for minimizing maximum lateness on a single machine with family-dependent set-up timesComput Opns Res2008352018203310.1016/j.cor.2006.10.003
- WebsterSBakerKRScheduling groups of jobs on a single machineOpns Res19954369270310.1287/opre.43.4.692
- YangWHSurvey of scheduling research involving setup timesInt J Syst Sci19993014315510.1080/002077299292498