Exact method for the two-machine flow-shop problem with time delays
type: Item
instance of: scholarly article
title: Exact method for the two-machine flow-shop problem with time delays
zbMATH Open document ID: 1462.90050
author: Mohamed Amine Mkadem
author: A. Moukrim
author: Mehdi Serairi
published in: Annals of Operations Research
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7344552
zbMATH Keywords: two-machine flow-shop
zbMATH Keywords: time delay
zbMATH Keywords: makespan
zbMATH Keywords: lower bound
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
full work available at URL: s10479-018-3082-x
OpenAlex ID: W2898514716
cites work: A survey of scheduling problems with setup times or costs
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Shop Problems With Two Machines and Time Lags
cites work: Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
cites work: Permutation flowshop scheduling problems with maximal and minimal time lags
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Algorithms and Computation
cites work: Sequencing \(n\) jobs on two machines with arbitrary time lags
cites work: Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays
cites work: A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
cites work: UET flow shop scheduling with delays
cites work: Q4884350
cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
DOI: 10.1007/S10479-018-3082-X
description: scientific article; zbMATH DE number 7344552