Paper Info
Title
Due-window assignment problems with unit-time jobs.
Abstract
We study a class of due-window assignment problems. The objective is to find the job sequence and the window starting time and size, such that the total cost of earliness, tardiness and due-window is minimized. The study assumes unit-time jobs, and considers settings of a single machine and of parallel identical machines. Both the due-window starting time and size are decision variables. For the single machine setting, we study a complete set of problems consisting of all possible combinations of the decision variables and four cost factors (earliness, tardiness, due-window size and due-window starting time). For parallel identical machines, we study a complete set of problems consisting of all possible combinations of the decision variables and three cost factors (earliness, tardiness and due-window size). All the problems are shown to be solvable in no more than O(n^3) time, where n is the number of jobs.
Year
DOI
Venue
2013
10.1016/j.amc.2013.05.045
Applied Mathematics and Computation
Keywords
Field
DocType
possible combination,cost factor,complete set,parallel identical machine,unit-time job,due-window size,due-window assignment problem,single machine,total cost,decision variable,single machine setting,assignment problem,scheduling
Decision variables,Mathematical optimization,Tardiness,Scheduling (computing),Assignment problem,Factor cost,Total cost,Mathematics
Journal
Volume
ISSN
Citations 
220
0096-3003
6
PageRank 
References 
Authors
0.50
19
2
Name
Order
Citations
PageRank
Enrique Gerstl1637.72
Gur Mosheiov21073105.02