Two machine flow shop scheduling problem with weighted WIP costs
type: Item
instance of: scholarly article
title: Two machine flow shop scheduling problem with weighted WIP costs
zbMATH Open document ID: 1163.90009
author: Jaehwan Yang
published in: Computers \& Operations Research
publication date: 2008-11-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5363313
zbMATH Keywords: WIP cost
zbMATH Keywords: two machine flow shop
zbMATH Keywords: computational complexity
zbMATH Keywords: heuristic analysis
MaRDI profile type: Publication
full work available at URL: j.cor.2007.09.014
OpenAlex ID: W1974622464
cites work: The complexity of scheduling jobs in repetitive manufacturing systems
cites work: Q3358512
cites work: Erratum to: ``Flow shops with WIP and value added costs''
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Openshop and flowshop scheduling to minimize sum of completion times
cites work: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
cites work: The two-machine total completion time flow shop problem
cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
cites work: Minimizing total completion time in a two-machine flowshop: Analysis of special cases
cites work: Minimizing the total flow time and the tardiness in a two-machine flow shop
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4658190
cites work: Some new results in flow shop scheduling
cites work: Q4198056
DOI: 10.1016/J.COR.2007.09.014
description: scientific article; zbMATH DE number 5363313