The consecutive multiprocessor job scheduling problem

DOI10.1016/j.ejor.2019.12.043zbMath1441.90058OpenAlexW2999566486WikidataQ126406284 ScholiaQ126406284MaRDI QIDQ2178063

Ilya Zaides, Yossi Bukchin, Tal Raviv

Publication date: 7 May 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.12.043

zbMATH Keywords

integer programmingschedulingconstraint programmingmultiprocessor job scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• ILOG SCHEDULE

Cites Work

• Unnamed Item
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A note on scheduling multiprocessor tasks with identical processing times.
• The berth allocation problem: models and solution methods
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• Mathematical models for the berth allocation problem in dry bulk terminals
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
• Approximating total flow time on parallel machines
• An Exact Approach to the Strip-Packing Problem
• Principles of Constraint Programming
• Scheduling

This page was built for publication: The consecutive multiprocessor job scheduling problem