Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence

DOI10.1016/j.disopt.2011.11.001zbMath1242.90077OpenAlexW1996135521MaRDI QIDQ435728

Mikhail Y. Kovalyov, Bertrand M. T. Lin, Feng-Jang Hwang

Publication date: 12 July 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2011.11.001

zbMATH Keywords

dynamic programmingtotal completion timefixed sequencetwo-machine flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (4)

Relocation scheduling subject to fixed processing sequences ⋮ Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence

Cites Work

• Unnamed Item
• Batching decisions for assembly production systems
• An improved earliness--tardiness timing algorithm
• Batching and scheduling in a multi-machine flow shop
• A concise survey of scheduling with time-dependent processing times
• An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
• Optimal timing of a sequence of tasks with general completion costs
• Scheduling with batching: A review
• Minimizing the earliness--tardiness costs on a single machine
• Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• The open shop scheduling problem with a given sequence of jobs on one machine
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing
• Two‐machine flowshop scheduling with conditional deteriorating second operations

This page was built for publication: Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence