Two machine flow shop scheduling problem with weighted WIP costs

DOI10.1016/J.COR.2007.09.014MaRDI QIDQ954049zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Flow shops with WIP and value added costs
• A two-machine flow shop scheduling problem with controllable job processing times
• scientific article; zbMATH DE number 4158358
• scientific article; zbMATH DE number 4074798
• scientific article; zbMATH DE number 4010197

Cites work

• scientific article; zbMATH DE number 4209899 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• 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
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Openshop and flowshop scheduling to minimize sum of completion times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some new results in flow shop scheduling
• The Complexity of Flowshop and Jobshop Scheduling
• The complexity of scheduling jobs in repetitive manufacturing systems
• The two-machine total completion time flow shop problem

Cited in

(3)

• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• Flow shops with WIP and value added costs
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs

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

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