Scheduling under a common due-date on parallel unrelated machines
From MaRDI portal
(Redirected from Publication:1291766)
Recommendations
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- A common due-data assignment problem on parallel identical machines
- A survey of the state-of-the-art of common due date assignment and scheduling research
- scientific article; zbMATH DE number 4059106
- Multiple common due dates
Cites work
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- A Note on the Common Due-Date Assignment Problem
- A state-of-the-art review of parallel-machine scheduling research
- An alternative proof of optimality for the common due-date assignment problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
- Single- and multiple-processor models for minimizing completion time variance
- Single-machine sequencing with controllable processing times
Cited in
(17)- Hierarchical production planning and scheduling in a multi-product, batch process environment
- Parallel machine scheduling with a common due window
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- A common due-data assignment problem on parallel identical machines
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A production rescheduling expert simulation system
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- A Neural Network Model For The Common Due Date Job Scheduling On Unrelated Parallel Machines
- Bicriteria scheduling problem for unrelated parallel machines with release dates
- A survey on scheduling problems with due windows
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
This page was built for publication: Scheduling under a common due-date on parallel unrelated machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291766)
