Two machine flow shop scheduling problem with weighted WIP costs

DOI10.1016/J.COR.2007.09.014zbMATH Open1163.90009OpenAlexW1974622464MaRDI QIDQ954049FDOQ954049

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

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

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)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• The two-machine total completion time flow shop problem
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• The Complexity of Flowshop and Jobshop Scheduling
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• The complexity of scheduling jobs in repetitive manufacturing systems
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Some new results in flow shop scheduling
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Openshop and flowshop scheduling to minimize sum of completion times
• Title not available (Why is that?)
• Erratum to: ``Flow shops with WIP and value added costs
• Minimizing the total flow time and the tardiness in a two-machine flow shop

Cited In (3)

• Flow shops with WIP and value added costs
• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• 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)