Problem F2||C_ with forbidden jobs in the first or last position is easy

DOI10.1016/J.EJOR.2006.01.018zbMATH Open1107.90020OpenAlexW2081153299WikidataQ57633916 ScholiaQ57633916MaRDI QIDQ856325FDOQ856325

Authors: M. Y. Kovalyov, Frank Werner 

Publication date: 7 December 2006

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

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

Recommendations

• The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems
• On non-permutation solutions to some two machine flow shop scheduling problems
• A flowshop scheduling problem with two operations per job
• Flow shop scheduling jobs with position-dependent processing times
• Two-machine flow shops with an optimal permutation schedule under a storage constraint

zbMATH Keywords

schedulingmakespanflow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems

Cited In (2)

• The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems
• No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines

This page was built for publication: Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy

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