Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times

Authors:
Xiao-Yuan Wang;Ming-Zheng Wang;Ji-Bo Wang
Affiliations:
School of Science, Shenyang Aerospace University, Shenyang 110136, China;School of Management Science and Engineering, Dalian University of Technology, Dalian 116024, China;School of Science, Shenyang Aerospace University, Shenyang 110136, China
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 13
Cited 2

Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters
Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics
Scheduling linearly deteriorating jobs on multiple machines

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
Flow shop scheduling problems with decreasing linear deterioration under dominant machines

Computers and Operations Research
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research
A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
Some scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates

Computers and Operations Research
Time-Dependent Scheduling

Time-Dependent Scheduling
Two-machine flow shop scheduling with linear decreasing job deterioration

Computers and Industrial Engineering
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs

Computers and Operations Research
Scheduling jobs under decreasing linear deterioration

Information Processing Letters

Short Communication: A note on "Single machine scheduling with time-dependent deterioration and exponential learning effect"

Computers and Industrial Engineering
Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study, we consider an n-job, m-machine flow shop scheduling problem with decreasing time-dependent job processing times. By the decreasing time-dependent job processing times, we mean that the processing time is a decreasing function of its execution starting time. When some dominant relationships between m-1 machines can be satisfied, we show that the makespan minimization problem can be solved in polynomial time.