The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems

DOI10.1016/j.ejor.2003.08.031zbMath1065.90035OpenAlexW2028781173MaRDI QIDQ1887767

Pierre Baptiste, Mohamed Moalla, Nour El Houda Saadani

Publication date: 22 November 2004

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

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

zbMATH Keywords

SchedulingMakespanFlow-shopNo-idle

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy, Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, Johnson's rule, composite jobs and the relocation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• NP-hardness of compact scheduling in simplified open and flow shops.