A common due-data assignment problem on parallel identical machines
From MaRDI portal
Publication:5953163
DOI10.1016/S0305-0548(99)00127-6zbMath1015.90042WikidataQ126351418 ScholiaQ126351418MaRDI QIDQ5953163
Publication date: 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Optimal due date assignment in multi-machine scheduling environments ⋮ Strategic production planning of an automated manufacturing system through market forecasting ⋮ Two due date assignment problems in scheduling a single machine ⋮ A heuristic for single machine common due date assignment problem with different earliness/tardiness weights ⋮ Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine ⋮ Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Due date assignments and scheduling a single machine with a general earliness/tardiness cost function ⋮ Scheduling job classes on uniform machines ⋮ A note on a due-date assignment on a two-machine flow-shop ⋮ Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ Dynamic machining control and scheduling for multiple production projects in a deterministic period
Cites Work
- Survey of scheduling research involving due date determination decisions
- The Asymptotic Optimality of the LPT Rule
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- The parallel machine min-max weighted absolute lateness scheduling problem
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
- Bounds on Multiprocessing Timing Anomalies
