Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling
From MaRDI portal
Publication:6613982
DOI10.1007/s12597-024-00750-8MaRDI QIDQ6613982
Publication date: 7 October 2024
Published in: Opsearch (Search for Journal in Brave)
earlinesscommon due datetardinessoptimal policyunrelated parallel machinethe sum of completion times
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- A new method for solving fully fuzzy linear programming problems
- Scheduling on parallel identical machines to minimize total tardiness
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- The concept of a linguistic variable and its application to approximate reasoning. I
- Chance constrained programming with fuzzy parameters
- Scheduling under a common due-date on parallel unrelated machines
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Multiple-machine scheduling with earliness, tardiness and completion time penalties
- Parallel machine scheduling with earliness and tardiness penalties
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- A tabu search algorithm for parallel machine total tardiness problem
- The due date assignment scheduling problem with the deteriorating jobs and delivery time
- Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times
- Dominance inequalities for scheduling around an unrestrictive common due date
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness 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
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- A single machine group scheduling problem with due date assignment and position-dependent costs
This page was built for publication: Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling