A note on the SPT heuristic for solving scheduling problems with generalized due dates
From MaRDI portal
Publication:1433162
DOI10.1016/S0305-0548(03)00018-2zbMath1048.90107OpenAlexW1989949708MaRDI QIDQ1433162
Publication date: 15 June 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00018-2
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 (16)
A single machine scheduling with generalized and periodic due dates to minimize total deviation ⋮ Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions ⋮ A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ Single machine scheduling with rejection and generalized parameters ⋮ A note: minmax due-date assignment problem with lead-time cost ⋮ Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals ⋮ Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints ⋮ Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ Order acceptance and scheduling with delivery under generalized parameters ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty ⋮ Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
Cites Work
This page was built for publication: A note on the SPT heuristic for solving scheduling problems with generalized due dates
