Journal ArticleDOI
Single-machine scheduling with common due-window assignment for deteriorating jobs
J Liu,Yuqing Wang,X Min +2 more
TLDR
An O(n2 log n) time algorithm is proposed to solve the single-machine common due-window assignment scheduling problem with deteriorating jobs to minimize the weighted sum of earliness, tardiness and due- window location penalties.Abstract:
In this paper, we consider a single-machine common due-window assignment scheduling problem with deteriorating jobs. Jobs’ processing times are defined by function of their starting times and job-dependent deterioration rates that are related to jobs and are not all equal. The objective is to determine an optimal combination of sequence and common due-window location so as to minimize the weighted sum of earliness, tardiness and due-window location penalties. We propose an O(n2 log n) time algorithm to solve the problem and discuss several instances to illustrate it.read more
Citations
More filters
Journal ArticleDOI
Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times
TL;DR: This paper addresses single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times and shows that the problem under the model where the two criteria are integrated into a single criterion is polynomially solvable.
Journal ArticleDOI
Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review
TL;DR: This paper contributes to the field with a survey that covers problems where the common due date (window) is a given constraint as well as the ones where it is a decision variable and discusses 26 structural properties that characterize optimal solutions shared by problems from single, parallel, and flow-shop machine environments.
Journal ArticleDOI
Due-window assignment scheduling problems with position-dependent weights on a single machine
TL;DR: An integrated optimization problem of production scheduling and common due-window assignment on a single machine is dealt with and it is proved that both these extensions remain polynomially solvable.
Journal ArticleDOI
Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time
TL;DR: This paper considers a two-machine flow shop scheduling problem with deteriorating jobs in which the processing times of jobs are dependent on their starting times in the sequence, and proposes a mixed integer programming model and a branch-and-bound algorithm.
Journal ArticleDOI
Single-machine common/slack due window assignment problems with linear decreasing processing times
TL;DR: This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linearNon-increasing function of its starting time.
References
More filters
Book
Scheduling: Theory, Algorithms, and Systems
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Journal ArticleDOI
A concise survey of scheduling with time-dependent processing times
TL;DR: A framework is provided to illustrate how models for this class of machine scheduling problems have been generalized from the classical scheduling theory, and a complexity boundary is presented for each model.
Journal ArticleDOI
Scheduling with time dependent processing times: Review and extensions
TL;DR: This paper reviews the rapidly growing literature on single machine scheduling models with time dependent processing times and attention is focused on linear, piecewise linear and non-linear processing time functions for jobs.
Journal ArticleDOI
Scheduling deteriorating jobs on a single processor
Sid Browne,Uri Yechiali +1 more
TL;DR: This paper analyzes the effects of different deterioration schemes and derive optimal scheduling policies that minimize the expected makespan, and, for some models, policies that minimizing the variance of the makespan.
Related Papers (5)
A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
Chuanli Zhao,Hengyong Tang +1 more