Evaluating scheduling heuristics for non-identical parallel processors

DOI10.1080/002075497195489MaRDI QIDQ4245248zbMATH OpenOpenAlexFDO

Authors

Publication date 8 June 1999

Published in International Journal of Production Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• A nonidentical parallel processor scheduling problem
• An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates
• Heuristics for scheduling unrelated parallel machines
• Job Tardiness in Unequal Parallel Processor Systems
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs

Cited in

(8)

• A Heuristic of Scheduling Parallel Tasks and Its Analysis
• A new dynamic look-ahead scheduling procedure for batching machines
• Worst-case analysis of scheduling heuristics of parallel systems
• A nonidentical parallel processor scheduling problem
• Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
• Minimizing the average tardiness: the case of outsource machines
• An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates
• Job Tardiness in Unequal Parallel Processor Systems

This page was built for publication: Evaluating scheduling heuristics for non-identical parallel processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245248)