A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
Author:
- Onur OzturkOOOnur Ozturk
- 1 October 2020
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 286 (2) , 432-443
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Heuristics for makespan minimization on parallel batch processing machines with unequal job ready timesThe International Journal of Advanced Manufacturing Technology, 2009
- A GRASP approach for makespan minimization on parallel batch processing machinesJournal of Intelligent Manufacturing, 2009
- A PTAS for Semiconductor Burn-in SchedulingJournal of Combinatorial Optimization, 2005
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivalsComputers & Operations Research, 2002
- Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedureComputers & Operations Research, 2002
- Minimizing makespan on a single burn-in oven in semiconductor manufacturingEuropean Journal of Operational Research, 2000
- Scheduling a single batch processing machine with non-identical job sizesInternational Journal of Production Research, 1994
- Efficient Algorithms for Scheduling Semiconductor Burn-In OperationsOperations Research, 1992
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Complexity of Machine Scheduling Problems1977