Minmax scheduling with job-classes and earliness-tardiness costs
From MaRDI portal
(Redirected from Publication:856255)
Recommendations
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
- Scheduling job classes on uniform machines
- Minmax earliness-tardiness costs with unit processing time jobs
- A common due-data assignment problem on parallel identical machines
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Cites work
- scientific article; zbMATH DE number 151905 (Why is no real title available?)
- A dynamic programming method for single machine scheduling
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- A heuristic for single machine scheduling with early and tardy costs
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
- Single machine scheduling with symmetric earliness and tardiness penalties
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- The Asymptotic Optimality of the LPT Rule
- The Single Machine Early/Tardy Problem
Cited in
(8)- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
- Order acceptance and due-date quotation in low machine rates
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Scheduling job classes on uniform machines
- Minimizing maximum earliness on parallel identical machines
- Minmax earliness-tardiness costs with unit processing time jobs
- The optimal dispatch of Traffic and Patrol Police Service Platforms
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
This page was built for publication: Minmax scheduling with job-classes and earliness-tardiness costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856255)