Two machine flow shop scheduling problem with weighted WIP costs

DOI10.1016/j.cor.2007.09.014zbMath1163.90009OpenAlexW1974622464MaRDI QIDQ954049

Jaehwan Yang

Publication date: 7 November 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.09.014

zbMATH Keywords

computational complexitytwo machine flow shopheuristic analysisWIP cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Single machine scheduling problem with interval processing times to minimize mean weighted completion time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Openshop and flowshop scheduling to minimize sum of completion times
• The two-machine total completion time flow shop problem
• The complexity of scheduling jobs in repetitive manufacturing systems
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Erratum to: ``Flow shops with WIP and value added costs
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• Some new results in flow shop scheduling
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Two machine flow shop scheduling problem with weighted WIP costs