Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
- 20 January 2013
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 17 (6) , 521-540
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristicsExpert Systems with Applications, 2010
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizesComputers & Operations Research, 2008
- Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approachEuropean Journal of Operational Research, 2007
- Scheduling on parallel identical machines to minimize total tardinessEuropean Journal of Operational Research, 2007
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative exampleAnnals of Operations Research, 2006
- Scheduling a single batch processing machine with arbitrary job sizes and incompatible job familiesInternational Journal of Production Economics, 2005
- Scheduling with batching: A reviewEuropean Journal of Operational Research, 2000
- A review of scheduling research involving setup considerationsOmega, 1999
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penaltiesComputers & Operations Research, 1996
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995