Permutation flowshop scheduling problems with maximal and minimal time lags
From MaRDI portal
Publication:2581596
DOI10.1016/j.cor.2004.11.006zbMath1091.90081OpenAlexW2077452883MaRDI QIDQ2581596
Marie-Claude Portmann, Julien Fondrevelle, Ammar Oulamara
Publication date: 10 January 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.11.006
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic, Exact method for the two-machine flow-shop problem with time delays, Three-machine flow shop scheduling with overlapping waiting time constraints, The two-machine no-wait general and proportionate open shop makespan problem, Polynomial time algorithms for the UET permutation flowshop problem with time delays, Scatter search with path relinking for the job shop with time lags and setup times, Parallel partitioning method (PPM): A new exact method to solve bi-objective problems, Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling, Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints, Modeling realistic hybrid flexible flowshop scheduling problems, Minimizing the number of late jobs for the permutation flowshop problem with secondary resources, A memetic algorithm for the job-shop with time-lags, Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints, Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags, Two-machine flowshop scheduling problem with coupled-operations, SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Optimal two- and three-stage production schedules with setup times included
- General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration
- Shop Problems With Two Machines and Time Lags
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
