Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

DOI10.1016/S0895-7177(00)00250-8zbMath0981.90022WikidataQ57633953 ScholiaQ57633953MaRDI QIDQ5936755

J. Bank, Frank Werner

Publication date: 8 July 2001

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

local searchcommon due dateconstructive heuristicsearlines and tardiness penaltiesrelease datesunrelated parallel machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain ⋮ Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints ⋮ 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 ⋮ An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics ⋮ Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Scheduling about a common due date with earliness and tardiness penalties
• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Survey of scheduling research involving due date determination decisions
• Equivalence of mean flow time problems and mean absolute deviation problems
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Single machine earliness and tardiness scheduling
• Scheduling under a common due-date on parallel unrelated machines
• Parallel machine scheduling with earliness and tardiness penalties
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
• Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
• A comparison of local search methods for flow shop scheduling
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• Convergence of an annealing algorithm
• Single- and multiple-processor models for minimizing completion time variance
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the sum of job earliness and tardiness in a multimachine system
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

This page was built for publication: Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties