Optimal sequencing by modular decomposition: Polynomial algorithms
Operations Research
Optimal sequencing via modular decomposition: characterization of sequencing functions
Mathematics of Operations Research
Incremental modular decomposition
Journal of the ACM (JACM)
Scheduling deteriorating jobs on a single processor
Operations Research
A survey of results for sequencing problems with controllable processing times
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Mathematics of Operations Research
Earliness penalties on a single machine subject to precedence constraints
Computers and Operations Research
Single machine scheduling with a variable common due date and resource-dependent processing times
Computers and Operations Research
A note on a due-date assignment on a two-machine flow-shop
Computers and Operations Research
Pre-Emptive Scheduling Problems with Controllable Processing Times
Journal of Scheduling
Single machine scheduling with controllable release and processing parameters
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Optimal due date assignment in multi-machine scheduling environments
Journal of Scheduling
A note: Common due date assignment for a single machine scheduling with the rate-modifying activity
Computers and Operations Research
Scheduling a maintenance activity and due-window assignment on a single machine
Computers and Operations Research
Manufacturing & Service Operations Management
Computers and Operations Research
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
Due-date assignment and maintenance activity scheduling problem
Mathematical and Computer Modelling: An International Journal
Optimal assignment of due-dates for preemptive single-machine scheduling
Mathematical and Computer Modelling: An International Journal
Two due date assignment problems in scheduling a single machine
Operations Research Letters
Computers and Industrial Engineering
Hi-index | 0.00 |
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.