References
- RoyBSussmanBLes problemes d'ordonnancement avec constraints disjonctivesNote DS No 91964
- OvacikIMUzsoyRRolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup timesInt J Product Res1994321243126310.1080/00207549408956998
- OvacikIMUzsoyRExploiting shop floor status information to schedule complex job shopsJ Manuf Systems199413738410.1016/0278-6125(94)90023-X
- RamudhinAMarierPThe generalized shifting bottleneck procedureEur J Opl Res199693344810.1016/0377-2217(95)00135-2
- IvensPLembrechtMExtending the shifting bottleneck procedure to real-life applicationsEur J Opl Res19969025226810.1016/0377-2217(95)00353-3
- GareyMRJohnsonDSComputers and Intractability1979
- HolthausORajendranCEfficient dispatching rules for scheduling in a job shopInt J Product Econ1997488710510.1016/S0925-5273(96)00068-0
- LalsarePSenSEvaluating backward scheduling and sequencing rules for an assembly shop environmentProduct Inventory Mngt J1995367177
- AdamsJBalasEZawackDThe shifting bottleneck procedure for job shop schedulingMngt Sci19883439140110.1287/mnsc.34.3.391
- Dauzere-PerexSLasserreJBA modified shifting bottleneck procedure for job-shop schedulingInt J Product Res19933192393210.1080/00207549308956766
- van LaarhovenPJMAartsELLenstraJKJob shop scheduling by simulated annealingOpns Res19924011312510.1287/opre.40.1.113
- NowickiESmutnickiCA fast taboo search algorithm for the job shop problemMngt Sci19964279781310.1287/mnsc.42.6.797
- CandidoMABKhatorSKBarciaRMA genetic algorithm based procedure for more realistic job shop scheduling problemsInt J Product Res1998123437345710.1080/002075498192148
- ArmentanoVAScrichCRTabu search for minimizing total tardiness in a job shopInt J Product Econ20006313114010.1016/S0925-5273(99)00014-6
- CorryPGImproving efficiency in an iron foundry using meta-heuristics2002
- CorryPGKozanEOptimising a horizontally integrated push/pull hybrid production system in a foundryOperations Research/Management Science at Work2002189204