Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence

DOI10.1007/S10951-016-0493-XzbMath1376.90026OpenAlexW2512682559MaRDI QIDQ2400438

Jatinder N. D. Gupta, Feng-Jang Hwang, Bertrand M. T. Lin

Publication date: 1 September 2017

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0493-x

zbMATH Keywords

flowshopNP-hardnessdynamic programfixed job sequencethree-operation job

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Exact solution of the two-machine flow shop problem with three operations ⋮ Shop scheduling problems with pliable jobs

Cites Work

• Relocation scheduling subject to fixed processing sequences
• Two-machine flowshop scheduling with flexible operations and controllable processing times
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
• Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Throughput optimization in two-machine flowshops with flexible operations
• Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
• Optimal two- and three-stage production schedules with setup times included
• The open shop scheduling problem with a given sequence of jobs on one machine

This page was built for publication: Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence