A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
type: Item
instance of: scholarly article
title: A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
zbMATH Open document ID: 1251.90147
author: L. Hege
author: Michel Minoux
author: W. van Canneyt
author: C. Gicquel
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6107494
zbMATH Keywords: hybrid flow-shop scheduling
zbMATH Keywords: batch scheduling
zbMATH Keywords: limited-wait constraints
zbMATH Keywords: discrete-time model
zbMATH Keywords: mixed-integer linear programming
zbMATH Keywords: valid inequalities
MaRDI profile type: Publication
full work available at URL: j.cor.2011.02.017
OpenAlex ID: W2062141640
cites work: The hybrid flow shop scheduling problem
cites work: Modeling realistic hybrid flexible flowshop scheduling problems
cites work: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
cites work: Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
cites work: Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic
cites work: An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
cites work: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
cites work: A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
cites work: Sequencing of jobs in some production system
cites work: No-wait flexible flowshop scheduling with no-idle machines
cites work: Influence of capacity- and time-constrained intermediate storage in two-stage food production systems
cites work: Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
cites work: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
cites work: LP-based heuristics for scheduling chemical batch processes
cites work: Q5461284
DOI: 10.1016/J.COR.2011.02.017
description: scientific article; zbMATH DE number 6107494