List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan

DOI10.1080/02522667.2006.10699708zbMath1122.90044OpenAlexW2328480934MaRDI QIDQ5292944

Peerayuth Charnsethikul, Seekharin Sukto

Publication date: 25 June 2007

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2006.10699708

zbMATH Keywords

schedulingcolumn generationparallel machinesbin packingcompletion timecutting stockmulti-processorLP-based heuristiclongest processing timeminimize makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan

Cites Work

• Unnamed Item
• A typology of cutting and packing problems
• Mathematical Methods of Organizing and Planning Production
• A Linear Programming Approach to the Cutting-Stock Problem
• A New Linear Programming Approach to the Cutting Stock Problem
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• An Application of Bin-Packing to Multiprocessor Scheduling
• List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan