A survey on scheduling problems with due windows

DOI10.1016/j.ejor.2014.09.043zbMath1341.90002OpenAlexW2030412460MaRDI QIDQ2630089

Adam Janiak, Tomasz Krysiak, Tomasz Kwiatkowski, Wladyslaw Janiak

Publication date: 25 July 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.09.043

zbMATH Keywords

schedulingdue windowsearliness/tardinessdue window assignmentnumber of early and tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (36)

Analysis of a discrete-time queue with time-limited overtake priority ⋮ Due-window assignment scheduling in the proportionate flow shop setting ⋮ Slack Due-Window Assignment Scheduling Problem with Deterioration Effects and a Deteriorating Maintenance Activity ⋮ Due-window assignment scheduling with past-sequence-dependent setup times ⋮ Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation ⋮ Due-window assignment scheduling problems with position-dependent weights on a single machine ⋮ Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance ⋮ Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties ⋮ Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ Resource allocation flowshop scheduling with learning effect and slack due window assignment ⋮ Just-in-time scheduling for a distributed concrete precast flow shop system ⋮ Learning variable neighborhood search for a scheduling problem with time windows and rejections ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects ⋮ A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect ⋮ Due-window assignment scheduling with job-rejection, truncated learning effects and setup times ⋮ Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine ⋮ Tackling Common Due Window Problem with a Two-Layered Approach ⋮ Minmax scheduling problems with common due-date and completion time penalty ⋮ Optimization for due-window assignment scheduling with position-dependent weights ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights ⋮ Multi-attribute assignment of trains to departures in rolling stock management. Multi-attribute assignment of trains to departures in rolling stock management. A contribution to the EURO/ROADEF 2014 challenge ⋮ Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties ⋮ A note on the single machine CON and CONW problems with lot scheduling ⋮ Single machine due window assignment resource allocation scheduling with job-dependent learning effect ⋮ Minmax due-date assignment on a two-machine flowshop ⋮ The single machine weighted mean squared deviation problem ⋮ Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ Due-window assignment scheduling problem with stochastic processing times ⋮ Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties ⋮ Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects ⋮ Due-window assignment scheduling with learning and deterioration effects ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects

Cites Work

• Unnamed Item
• Unnamed Item
• The just-in-time scheduling problem in a flow-shop scheduling system
• Improving fleet utilization for carriers by interval scheduling
• Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
• Single-machine due-window assignment problem with learning effect and deteriorating jobs
• On scheduling around large restrictive common due windows
• Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
• Single-machine scheduling against due dates with past-sequence-dependent setup times
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Due dates assignment and JIT scheduling with equal-size jobs
• A new MIP model for mine equipment scheduling by minimizing maintenance cost
• Minmax scheduling problems with a common due-window
• A multi-criteria scheduling with due-window assignment problem
• Scheduling a maintenance activity and due-window assignment on a single machine
• Single machine scheduling and due date assignment with positionally dependent processing times
• Scheduling identical jobs and due-window on uniform machines
• Survey of scheduling research involving due date determination decisions
• Single-machine scheduling with learning considerations
• Determination of common due window location in a single machine scheduling problem
• Single-machine scheduling with time windows and earliness/tardiness penalties
• Scheduling under a common due-date on parallel unrelated machines
• Due window scheduling for parallel machines
• Earliness-tardiness scheduling problems with a common delivery window
• Optimal common due-date with completion time tolerance
• Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
• A single machine scheduling problem with common due window and controllable processing times
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• A concise survey of scheduling with time-dependent processing times
• Machine scheduling with a rate-modifying activity
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
• A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Single machine scheduling with symmetric earliness and tardiness penalties
• Common due date scheduling with autonomous and induced learning
• Soft due window assignment and scheduling of unit-time jobs on parallel machines
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
• Single-machine scheduling problems with actual time-dependent and job-dependent learning effect
• Scheduling with a common due-window: polynomially solvable cases
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
• Due-window assignment with identical jobs on parallel uniform machines
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
• Learning and forgetting effects on a group scheduling problem
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
• Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
• Multicriteria scheduling
• Punctuality and idleness in just-in-time scheduling
• Mirror image property for the optimal solutions of two single processor scheduling problems with due intervals determination
• Scheduling Problems with Learning and Ageing Effects: A Survey
• A makespan study of the two-machine flowshop scheduling problem with a learning effect
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Common due window size and location determination in a single machine scheduling problem
• A bi-criteria two-machine flowshop scheduling problem with a learning effect
• Flow-shop scheduling with a learning effect
• Sequencing with Earliness and Tardiness Penalties: A Review
• A due-window assignment problem with position-dependent processing times
• Interval scheduling: A survey
• `` Strong NP-Completeness Results
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The parallel machine min-max weighted absolute lateness scheduling problem
• Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
• Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties
• Due-window assignment with unit processing-time jobs
• Parallel machine scheduling with common due windows
• Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
• A note on scheduling problems with learning effect and deteriorating jobs
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Due-Window Determination In Minmax Scheduling Problems
• Parallel Processing and Applied Mathematics
• Single-machine scheduling with a common due window
• Ship scheduling with soft time windows: An optimisation based approach
• Scheduling problems with a learning effect
• Parallel machine scheduling with a common due window

This page was built for publication: A survey on scheduling problems with due windows