Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
DOI10.1016/J.COR.2011.05.012zbMATH Open1251.90137OpenAlexW1982457289MaRDI QIDQ1761111FDOQ1761111
Authors: Inna G. Drobouchevitch, Jeffrey B. Sidney 
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.012
Recommendations
- Multiple-machine scheduling with earliness, tardiness and completion time penalties
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Due-window assignment with identical jobs on parallel uniform machines
- scientific article; zbMATH DE number 4059106
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Title not available (Why is that?)
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Optimal due date assignment in multi-machine scheduling environments
- Due-date assignment and early/tardy scheduling on identical parallel machines
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Sequencing with Earliness and Tardiness Penalties: A Review
- Due-date assignment on uniform machines
- Title not available (Why is that?)
- Equivalence of mean flow time problems and mean absolute deviation problems
- Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
Cited In (14)
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
- Optimal restricted due date assignment in scheduling
- A note: minmax due-date assignment problem with lead-time cost
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- A multi-agent system for the weighted earliness tardiness parallel machine problem
- Minimizing the sum of job earliness and tardiness in a multimachine system
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
This page was built for publication: Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761111)
