Flow shops with WIP and value added costs

DOI10.1007/S10951-009-0130-ZMaRDI QIDQ969753zbMATH OpenOpenAlexFDO

Authors Jaehwan Yang, Marc E. Posner

Publication date 7 May 2010

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-009-0130-z

zbMATH Keywords

heuristic analysismachine flow shopWIP cost

Mathematics Subject Classification ID

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

Recommendations

• Two machine flow shop scheduling problem with weighted WIP 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
• Sequencing CONWIP flow-shops: Analysis and heuristics

Cites work

• A new heuristic for the n-job, M-machine flow-shop problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Flowshop sequencing with mean flowtime objective
• scientific article; zbMATH DE number 4209899 (Why is no real title available?)
• scientific article; zbMATH DE number 1187164 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• 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
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• 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

(1)

• Two machine flow shop scheduling problem with weighted WIP costs

This page was built for publication: Flow shops with WIP and value added costs

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