Scheduling with due date assignment under special conditions on job processing
Gordon, Valerie, Strusevich, Vitaly and Dolgui, Alexandre (2012) Scheduling with due date assignment under special conditions on job processing. Journal of Scheduling, 15 (4). pp. 447-456. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-011-0240-2)Full text not available from this repository.
We review the results on scheduling with due date assignment under such conditions on job processing as given precedence constraints, maintenance activity or various scenarios of processing time changing. The due date assignment and scheduling problems arise in production planning when the management is faced with setting realistic due dates for a number of jobs. Most research on scheduling with due date assignment is focused on optimal sequencing of independent jobs. However, it is often found in practice that some products are manufactured in a certain order implied, for example, by technological, marketing or assembly requirements and this can be modeled by imposing precedence constraints on the set of jobs. In classical deterministic scheduling models, the processing conditions, including job processing times, are usually viewed as given constants. In many real-life situations, however, the processing conditions may vary over time, thereby affecting actual durations of jobs. In the models with controllable processing times, the scheduler can speed up job execution times by allocating some additional resources to the jobs. In the models with deterioration or learning, the actual processing time can depend either on the position or on the start time of a job in the schedule. In scheduling with deterioration, the later a job starts, the longer it takes to process, while in scheduling with learning, the actual processing time of a job gets shorter, provided that the job is scheduled later. We consider also scheduling models with optional maintenance activity. In manufacturing processing, production scheduling with preventive maintenance planning is one of the most significant methods in preventing the machinery from failure or wear.
|Additional Information:|| First published online 15th June 2011.  The shortened variant of the paper was presented at the 13th IFAC Symposium on Information Control Problems in Manufacturing, Moscow, Russia, June 3–5, 2009.|
|Uncontrolled Keywords:||scheduling, due date assignment, precedence constraints, deterioration, learning, maintenance activity|
|Subjects:||Q Science > QA Mathematics|
|School / Department / Research Groups:||School of Computing & Mathematical Sciences|
Faculty of Architecture, Computing & Humanities > School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Faculty of Architecture, Computing & Humanities > School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Faculty of Architecture, Computing & Humanities
|Last Modified:||10 Jul 2015 14:55|
Actions (login required)