Common due window assignment in parallel processor scheduling problem with nonlinear penalty functions

Authors:
Adam Janiak;Marcin Winczaszek
Affiliations:
Institute of Engineering Cybernetics, Wroclaw University of Technology, Wrocław, Poland;Institute of Engineering Cybernetics, Wroclaw University of Technology, Wrocław, Poland
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 3
Cited 2

Single-machine scheduling with a common due window

Computers and Operations Research
A common due-date assignment problem on parallel identical machines

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Minmax scheduling problems with a common due-window

Computers and Operations Research
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study a scheduling problem with earliness and tardiness penalties. The objective is to find a sequence of jobs on parallel identical processors and a common due window. The beginning and the end of the due window are decision variables but the size of the due window is constrained from above and below. A job incurs penalty if it completes before or after the due window. A penalty function is nonlinear and identical for all the jobs. In the considered problem we minimize the sum of earliness and tardiness penalties, due window location penalty and due window size penalty. We proved some properties of an optimal solution and constructed a pseudopolynomial time algorithm based on the dynamic programming method. We also established the computational complexity of the problem.