Flow shop scheduling problems with decreasing linear deterioration under dominant machines
type: Item
instance of: scholarly article
title: Flow shop scheduling problems with decreasing linear deterioration under dominant machines
zbMATH Open document ID: 1193.90116
author: N. E. Zubov
published in: Computers \& Operations Research
publication date: 2007-02-19T00:00:00Z
review text: In this paper, the author considers the general no-wait and no-idle flow shop scheduling problems with deteriorating jobs under dominant machines, where the no-wait constraint means that each job once started has to be processed without interruption until all of its operations are completed and the no-idle contraint means that each machine once it starts ists work has to process all operations assigned to it without any interruption. It is described a polynomial time algorithm for minimizing the makespan that provides the optimal solution within \(O(mn)\), where \(m\) is the number of machines and \(n\) is the number of jobs. The author shows that when the objective is to minimize the maximum lateness (tardiness) of a job, the solutions of a classical method may not hold.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5128193
zbMATH Keywords: scheduling
zbMATH Keywords: flow shop
zbMATH Keywords: linear deterioration
zbMATH Keywords: dominant machines
reviewed by: Petrica Pop
MaRDI profile type: Publication
full work available at URL: j.cor.2005.08.008
OpenAlex ID: W2030231974
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Complexity of scheduling tasks with time-dependent execution times
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: V-Shaped Policies for Scheduling Deteriorating Jobs
cites work: Scheduling jobs under simple linear deterioration
cites work: Scheduling jobs with position-dependent processing times
cites work: Single machine scheduling with step-deteriorating processing times
cites work: Complexity analysis of job-shop scheduling with deteriorating jobs
cites work: Q5047629
cites work: Flow shop scheduling problems with deteriorating jobs under dominating machines
cites work: The complexity of scheduling starting time dependent tasks with release times
cites work: Scheduling start time dependent jobs to minimize the total weighted completion time
cites work: Scheduling jobs under decreasing linear deterioration
cites work: Nonpreemptive flowshop scheduling with machine dominance
cites work: Flowshop scheduling with dominant machines
cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem
cites work: Flow-shops with a dominant machine
cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
cites work: The Three-Machine No-Wait Flow Shop is NP-Complete
cites work: No-wait or no-idle permutation flowshop scheduling with dominating machines
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
DOI: 10.1016/J.COR.2005.08.008
Recommended article: Flow shop scheduling problems with deteriorating jobs under dominating machines
Recommended article: Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
Recommended article: A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
Recommended article: Flowshop scheduling with dominant machines
Recommended article: Q3572619
Recommended article: Some single-machine and flowshop scheduling problems with a non-linear deterioration function
Recommended article: Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
Recommended article: Flow shop scheduling problems under machine-dependent precedence constraints
Recommended article: A note on the complexity of flow-shop scheduling with deteriorating jobs
description: scientific article; zbMATH DE number 5128193