A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
DOI10.1016/J.COR.2011.02.017zbMATH Open1251.90147OpenAlexW2062141640MaRDI QIDQ1762015FDOQ1762015
Authors: L. Hege, Michel Minoux, W. van Canneyt, C. Gicquel 
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.02.017
Recommendations
- Model formulations for the machine scheduling problem with limited waiting time constraints
- A survey on time constrained hybrid flow shop scheduling problems
- On the exact solution of the no-wait flow shop problem with due date constraints
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
valid inequalitiesdiscrete-time modelbatch schedulingmixed-integer linear programminghybrid flow-shop schedulinglimited-wait constraints
Cites Work
- The hybrid flow shop scheduling problem
- Sequencing of jobs in some production system
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Modeling realistic hybrid flexible flowshop scheduling problems
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Influence of capacity- and time-constrained intermediate storage in two-stage food production systems
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- LP-based heuristics for scheduling chemical batch processes
- No-wait flexible flowshop scheduling with no-idle machines
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic
- Title not available (Why is that?)
Cited In (7)
- Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm
- Three-machine flow shop scheduling with overlapping waiting time constraints
- On the exact solution of the no-wait flow shop problem with due date constraints
- Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
- Model formulations for the machine scheduling problem with limited waiting time constraints
This page was built for publication: A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762015)
