We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4396807 | PMC |
| http://dx.doi.org/10.1155/2015/740750 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times.
Math Biosci Eng
June 2022
School of Science, Shenyang Aerospace University, Shenyang, China.
This article deals with common due-window assignment and single-machine scheduling with proportional-linear shortening processing times. Objective cost is a type of minmax, that is, the maximal cost among all processed jobs is minimized. Our goal is to determine an optimal schedule, the optimal starting time, and size of due-window that minimize the worst cost, which consist of four parts: earliness, tardiness, starting time and length of the due-window.
View Article and Find Full Text PDFDue-window assignment scheduling with past-sequence-dependent setup times.
Math Biosci Eng
January 2022
Business School, Northwest Normal University, Lanzhou 730070, China.
This article investigates the due-window assignment scheduling problem with setup times on a single machine, where setup times of jobs are past-sequence-dependent. Under common, slack and unrestricted due-window assignment methods, the goal is to determine the optimal job sequence and due-window such that the cost function (i.e.
View Article and Find Full Text PDFSingle machine resource allocation scheduling problems with deterioration effect and general positional effect.
Math Biosci Eng
March 2021
School of Business, University of North Carolina at Pembroke, USA.
This paper investigates single machine scheduling problems where the actual processing time of a job is dependent on its starting time, processing position and the amount of resource allocation. We present two unified models and provide a bicriteria analysis for the general scheduling criteria and the total weighted resource consumption. We consider two different versions for treating the two criteria and show that the unified models can be applied to solve scheduling problems under various due window assignment considerations.
View Article and Find Full Text PDFDue-window assignment scheduling with variable job processing times.
ScientificWorldJournal
January 2016
Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong.
We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!