Parallel machine earliness and tardiness scheduling with proportional weights
From MaRDI portal
Publication:1870834
DOI10.1016/S0305-0548(02)00055-2zbMath1026.90042MaRDI QIDQ1870834
Publication date: 14 May 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (19)
Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics ⋮ Dynamic routing strategies for JIT production in hybrid flow shops ⋮ A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ A united search particle swarm optimization algorithm for multiobjective scheduling problem ⋮ Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem ⋮ Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost ⋮ Just-in-Time Scheduling with Equal-Size Jobs ⋮ Exponential neighborhood search for a parallel machine scheduling problem ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach ⋮ Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration ⋮ Batch sizing and just-in-time scheduling with common due date ⋮ Planning production using mathematical programming: The case of a woodturning company ⋮ Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Equivalence of mean flow time problems and mean absolute deviation problems
- Scheduling around a small common due date
- A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single- and multiple-processor models for minimizing completion time variance
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Minimizing the sum of job earliness and tardiness in a multimachine system
- Weighted Tardiness Single Machine Scheduling with Proportional Weights
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
This page was built for publication: Parallel machine earliness and tardiness scheduling with proportional weights