A survey of the state-of-the-art of common due date assignment and scheduling research

DOI10.1016/S0377-2217(01)00181-3MaRDI QIDQ1600949zbMATH OpenWikidataFDO

Authors Chengbin Chu, V. S. Gordon, Jean Marie Proth

Publication date 16 June 2002

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

zbMATH Keywords

schedulingsequencingdue date assignmentcommon due date

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Multiple common due dates
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• A common due-data assignment problem on parallel identical machines
• Scheduling under a common due-date on parallel unrelated machines
• Common due date assignment and scheduling with ready times

Cites work

• scientific article; zbMATH DE number 1594554 (Why is no real title available?)
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 4059106 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 108110 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• scientific article; zbMATH DE number 553762 (Why is no real title available?)
• scientific article; zbMATH DE number 563349 (Why is no real title available?)
• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• scientific article; zbMATH DE number 1016640 (Why is no real title available?)
• scientific article; zbMATH DE number 1044013 (Why is no real title available?)
• scientific article; zbMATH DE number 1128827 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• scientific article; zbMATH DE number 946721 (Why is no real title available?)
• scientific article; zbMATH DE number 782644 (Why is no real title available?)
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• A V-shape property of optimal schedule of jobs about a common due date
• A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem
• A state-of-the-art review of parallel-machine scheduling research
• Algorithms for minclique scheduling problems
• An algorithm for the CON due-date determination and sequencing problem
• An alternative proof of optimality for the common due-date assignment problem
• An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
• Batch scheduling and common due date assignment problem: An NP-hard case
• Batch scheduling and common due-date assignment on a single machine
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
• CON due-date determination and sequencing
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Common due date scheduling problem with separate earliness and tardiness penalties
• Common due window size and location determination in a single machine scheduling problem
• Common due-date determination and sequencing using tabu search
• Completion time variance minimization on a single machine is difficult
• DETERMINISTIC SCHEDULING IN COMPUTER SYSTEMS: A SURVEY
• Determination of an optimal common due date and optimal sequence in a single machine job shop
• Determination of common due window location in a single machine scheduling problem
• Due-date assignment and early/tardy scheduling on identical parallel machines
• Dynamic assignation of due-dates in an assembly shop based in simulation
• Earliness-Tardiness Scheduling Around Almost Equal Due Dates
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Equivalence of mean flow time problems and mean absolute deviation problems
• Form Similarities of the CON and SLK Due Date Determination Methods
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• Integrating order release control with due-date assignment rules
• Mimimization of agreeably weighted variance in single machine systems
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Minimizing flow time variance in a single machine system using genetic algorithms
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing tardy jobs in a flowshop with common due date
• Minimizing the average deviation of job completion times about a common due date
• Minimizing the maximum deviation of job completion time about a common due-date
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
• New results on the completion time variance minimization
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• On the Assignment of Optimal Due Dates
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• On the complexity of generalized due date scheduling problems
• On the general solution for a class of early/tardy problems
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimal common due-date with completion time tolerance
• Optimal common due-date with limited completion time
• Optimal common due-date with limited completion time deviation
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Regression-based due date assignment rules for improved assembly shop performance
• Scheduling about a common due date with earliness and tardiness penalties
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
• Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
• Scheduling around a small common due date
• Scheduling independent tasks to reduce mean finishing time
• Scheduling job families about an unrestricted common due date on a single machine
• Scheduling problems with non-regular penalty functions - a review
• Scheduling shops to minimize the weighted number of late jobs
• Scheduling under a common due-date on parallel unrelated machines
• Scheduling with monotonous earliness and tardiness penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
• Single machine scheduling with common due data assignment in a group technology environment
• Single- and multiple-processor models for minimizing completion time variance
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Single-machine scheduling with a common due window
• Single-machine scheduling with early and tardy completion costs
• Single-machine scheduling with learning considerations
• Single-machine sequencing with controllable processing times
• Survey of scheduling research involving due date determination decisions
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• The Total Tardiness Problem: Review and Extensions
• The complexity of scheduling job families about a common due date
• The parallel machine min-max weighted absolute lateness scheduling problem
• The weighted common due date single machine scheduling problem revisited
• Two parallel machine sequencing problems involving controllable job processing times
• Using tabu search to solve the common due date early/tardy machine scheduling problem
• Variance Minimization in Single Machine Sequencing Problems

Cited in

(only showing first 100 items - show all)

• A survey on scheduling problems with due windows
• Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
• A note: Common due date assignment for a single machine scheduling with the rate-modifying activity
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• Due dates assignment and JIT scheduling with equal-size jobs
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
• Scheduling problems with a common due window assignment: a survey
• A differential evolution approach for the common due date early/tardy job scheduling problem
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
• Scheduling a single machine with multiple due dates per job
• A due-date assignment problem with learning effect and deteriorating jobs
• Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
• Multicriteria models for just-in-time scheduling
• On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
• Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
• Single machine multiple common due dates scheduling with learning effects
• Improving delivery reliability by a new due-date setting rule
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• A fuzzy-neural knowledge-based system for job completion time prediction and internal due date assignment in a wafer fabrication plant
• Soft due window assignment and scheduling of unit-time jobs on parallel machines
• Machine scheduling with earliness, tardiness and non-execution penalties
• Multicriteria scheduling
• Revenue management and demand fulfillment: Matching applications, models, and software
• Group sequencing around a common due date
• Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects
• Proportionate flowshop scheduling with position-dependent weights
• Scheduling with due date assignment under special conditions on job processing
• Scheduling with a common due-window: polynomially solvable cases
• Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
• Due date assignment scheduling with positional-dependent weights and proportional setup times
• Bicriteria scheduling for due date assignment with total weighted tardiness
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
• Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times
• A Note on the Common Due-Date Assignment Problem
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
• An efficient local search for minimizing completion time variance in permutation flow shops
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• A multi-agent system for the weighted earliness tardiness parallel machine problem
• A note on a due-date assignment on a two-machine flow-shop
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• Due-window assignment with identical jobs on parallel uniform machines
• A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
• Scheduling problems with partially ordered jobs
• Two-agent single-machine scheduling with assignable due dates
• Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
• Integrated production and transportation scheduling problem under nonlinear cost structures
• Trading off due-date tightness and job tardiness in a basic scheduling model
• Minmax common due-window assignment scheduling with deteriorating jobs
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
• Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Modelling and integration of customer flexibility in the order commitment process for high mix low volume production
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
• Exponential neighborhood search for a parallel machine scheduling problem
• An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
• Scheduling in supply chain environment
• A survey on offline scheduling with rejection
• Due-date assignment on uniform machines
• Single-machine scheduling with upper bounded maintenance time under the deteriorating effect
• Four single-machine scheduling problems involving due date determination decisions
• Minimizing earliness and tardiness costs in stochastic scheduling
• New exact and heuristic algorithms for general production and delivery integration
• Due-date assignment with acceptable lead-times on parallel machines
• Self-adaptive biased differential evolution for scheduling against common due dates
• On scheduling around large restrictive common due windows
• Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
• Real-time due-date promising by build-to-order environments
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
• Minmax due-date assignment on a two-machine flowshop
• Just-in-time scheduling with equal-size jobs
• Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• Order acceptance and due-date quotation in low machine rates
• Permutation flow shop scheduling with earliness and tardiness penalties
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
• Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
• Optimal due-date assignment problem with learning effect and resource-dependent processing times
• Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times
• Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
• Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• Common due date scheduling with autonomous and induced learning
• Scheduling jobs with position and sum-of-processing-time based processing times
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• A mixed integer programming model for advanced planning and scheduling (APS)
• A multi-criteria scheduling with due-window assignment problem
• Single-machine due-window assignment problem with learning effect and deteriorating jobs
• Minmax due-date assignment with a time window for acceptable lead-times
• Multiple common due dates

This page was built for publication: A survey of the state-of-the-art of common due date assignment and scheduling research

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600949)