Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

DOI10.1016/j.cor.2006.08.017zbMath1278.90173OpenAlexW1992259816MaRDI QIDQ2459388

Dvir Shabtay

Publication date: 6 November 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.08.017

zbMATH Keywords

single-machine schedulingpolynomial time algorithmsdue date assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (12)

Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Due-window assignment problems with unit-time jobs ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Multi-coloring and job-scheduling with assignment and incompatibility costs ⋮ Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem ⋮ Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT ⋮ Minimizing earliness and tardiness costs in stochastic scheduling ⋮ Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs

Cites Work

• Two due date assignment problems in scheduling a single machine
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Completion time variance minimization on a single machine is difficult
• A survey of the state-of-the-art of common due date assignment and scheduling research
• A note on a due-date assignment on a two-machine flow-shop
• Batch scheduling and common due-date assignment on a single machine
• Minimizing Total Tardiness on One Machine is NP-Hard
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A common due-data assignment problem on parallel identical machines

This page was built for publication: Due date assignments and scheduling a single machine with a general earliness/tardiness cost function