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

DOI10.1016/J.DISOPT.2011.11.001MaRDI QIDQ435728zbMATHOpenAlexFDO

Authors F. J. Hwang, M. Y. Kovalyov, B. M. T. Lin

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 programmingfixed sequencetotal completion timetwo-machine flow shop

Mathematics Subject Classification ID

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

Recommendations

• Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
• Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
• An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
• scientific article; zbMATH DE number 4010197
• Two-machine flow-shop scheduling problems with minimizing the total completion times

Cites work

• scientific article; zbMATH DE number 1437089 (Why is no real title available?)
• 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
• An improved earliness--tardiness timing algorithm
• Batching and scheduling in a multi-machine flow shop
• Batching decisions for assembly production systems
• Minimizing the earliness--tardiness costs on a single machine
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimal timing of a sequence of tasks with general completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing
• Scheduling batches with sequential job processing for two-machine flow and open shops
• Scheduling with batching: A review
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• Single-machine scheduling with early and tardy completion costs
• The open shop scheduling problem with a given sequence of jobs on one machine
• Two‐machine flowshop scheduling with conditional deteriorating second operations

Cited in

(14)

• The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
• Relocation scheduling subject to fixed processing sequences
• Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Two-machine flowshop scheduling with job class setups to minimize total flowtime
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
• Total completion time minimization scheduling on two hierarchical uniform machines
• Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
• 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
• Total completion time minimization in a computer system with a server and two parallel processors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435728)