Survey of scheduling research involving due date determination decisions
From MaRDI portal
Publication:1111925
DOI10.1016/0377-2217(89)90100-8zbMath0658.90049MaRDI QIDQ1111925
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90100-8
90B35: Deterministic scheduling theory in operations research
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Multiple common due dates, A Neural Network Model For The Common Due Date Job Scheduling On Unrelated Parallel Machines, Scheduling problems with random processing times under expected earliness/tardiness costs, Real-time due-date promising by build-to-order environments, Simultaneous job input sequencing and vehicle dispatching in a single-vehicle automated guided vehicle system: a heuristic branch-and-bound approach coupled with a discrete events simulation model, Integrated Material Planning and Operations Scheduling (IMPOS), STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM, Single-machine scheduling with a common due window, Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties, A common due-data assignment problem on parallel identical machines, Fabrication scheduling on a single machine with due date constraints, Minimizing the number of tardy jobs with precedence constraints and agreeable due dates, The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem, Manufacturing lead-time rules: customer retention versus tardiness costs, Optimization-based available-to-promise with multi-stage resource availability, Scheduling flow shops using differential evolution algorithm, Effective on-line algorithms for reliable due date quotation and large-scale scheduling, A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, Modelling complex assemblies as a queueing network for lead time control, A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms, A mixed integer programming model for advanced planning and scheduling (APS), A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem, Dynamic programming approach to the single-machine sequencing problem with different due-dates, Optimal assignment of slack due-dates and sequencing in a single-machine shop, Single-machine scheduling with waiting-time-dependent due dates, A differential evolution approach for the common due date early/tardy job scheduling problem, Scheduling jobs with agreeable processing times and due dates on a single batch processing machine, Due date assignment for multistage assembly systems, Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness, On a single-machine optimal constant due-date assignment and sequencing problem, Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem, Mimimization of agreeably weighted variance in single machine systems, Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine, Single-machine sequencing with controllable processing times, Optimal due-date assignment and sequencing, Common due date scheduling problem with separate earliness and tardiness penalties, Delivery time quotation and order processing with forbidden early shipments, A due date assignment algorithm for multiproduct manufacturing facilities, Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method, Manufacturing lead times, system utilization rates and lead-time-related demand, Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs, Scheduling with batch setup times and earliness-tardiness penalties, Scheduling with agreeable release times and due dates on a batch processing machine, Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties, Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method, Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness, Lead time selection and the behaviour of work flow in job shops, An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups, Minimizing flow time variance in a single machine system using genetic algorithms, A note on optimal assignment of slack due-dates in single-machine scheduling, Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment, Single-machine scheduling to minimize earliness and number of tardy jobs, Job shop leadtime requirements under conditions of controlled delivery performance, Optimal assignment of due-dates for preemptive single-machine scheduling, Group scheduling jobs on a single machine: A multi-objective approach with preemptive priority structure, Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs, An evaluation of order release strategies in a remanufacturing environment, Single machine scheduling with common due data assignment in a group technology environment, Single machine scheduling with a variable common due date and resource-dependent processing times., A survey of the state-of-the-art of common due date assignment and scheduling research, Heuristics for hybrid flow shops with controllable processing times and assignable due dates, Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints, Single machine scheduling with assignable due dates, A tabu search algorithm for parallel machine total tardiness problem, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, Single machine scheduling to minimize total weighted tardiness, Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs, Makespan estimation in batch process industries: A comparison between regression analysis and neural networks, Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, Processing-plus-wait due dates in single-machine scheduling, Common due-date determination and sequencing using tabu search, Scheduling with monotonous earliness and tardiness penalties, Minimizing variation of production rates in just-in-time systems: A survey, Safe scheduling: Setting due dates in single-machine problems, Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance, Job sequencing and due date assignment in a single machine shop with uncertain processing times, Common due-date assignment and scheduling on single machine with exponential processing times., A multi-objective lead time control problem in multistage assembly systems using an interactive method, Manufacturing lead time estimation using data mining, Selecting jobs for heavily loaded shop with lateness penalties, Batch scheduling and common due-date assignment on a single machine, Setting due dates in a stochastic single machine environment, Minimizing flowtime and missed due-dates in single-machine sequencing, A study of integer programming formulations for scheduling problems, Due date assignment using artificial neural networks under different shop floor control strategies, Multi-agent-based workload control for make-to-order manufacturing, Using ensemble and metaheuristics learning principles with artificial neural networks to improve due date prediction performance, Maximizing set function formulation of two scheduling problems, Optimal assignment of NOP due-dates and sequencing in a single machine shop
Cites Work
- Unnamed Item
- Unnamed Item
- A V-shape property of optimal schedule of jobs about a common due date
- Optimal total-work-content-power due-date determination and sequencing
- An algorithm for the CON due-date determination and sequencing problem
- Optimal common due-date with limited completion time deviation
- Minimizing the maximum deviation of job completion time about a common due-date
- An alternative proof of optimality for the common due-date assignment problem
- V-shape property of optimal sequence of jobs about a common due date on a single machine
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the average deviation of job completion times about a common due date
- Analytical determination of optimal TWK due-dates in a job shop
- Optimal due-date assignment in a job shop†
- Minimizing mean absolute deviation of completion times about a common due date
- Single- and multiple-processor models for minimizing completion time variance
- Optimal due-date assignment for a single machine sequencing problem with random processing times
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- Lot Sizes, Lead Times and In-Process Inventories
- On Optimal Common Due-Date Determination
- Minimizing the average deviation of job completion times about a common due-date: An extension
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Optimal due-date determination and sequencing with random processing times
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- Optimal constant due-date assignment and sequencing
- Integration of priority dispatching and due-date assignment in a job shop
- Due Date Assignment for Production Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Note—On Anomalies in Dynamic Ratio Type Scheduling Rules: A Clarifying Analysis
- A Simulation Study of Operating Policies in a Hypothetical Dual-Constrained Job Shop
- Minimising Waiting Time Variance in the Single Machine Problem
- A Survey of Scheduling Rules
- A Simulation Study of Predictable Due-Dates
- A Note on the Common Due-Date Assignment Problem