Feasible job insertions in the multi-processor-task job shop

DOI10.1016/j.ejor.2005.10.077zbMath1146.90413OpenAlexW2083463020MaRDI QIDQ2464217

Nguyen Pham Dinh, Andreas Klinkert, Heinz Groeflin

Publication date: 10 December 2007

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

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

zbMATH Keywords

schedulingpolyhedral descriptionjob shopjob insertionmulti-processor-task

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany ⋮ Scheduling coupled-operation jobs with exact time-lags ⋮ The resource-constrained activity insertion problem with minimum and maximum time lags

Cites Work

• Tabu-search for the multi-mode job-shop problem
• A lower bound for the job insertion problem.
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• On the application of insertion techniques for job shop problems with setup times

This page was built for publication: Feasible job insertions in the multi-processor-task job shop