Early/tardy scheduling with sequence dependent setups on uniform parallel machines
From MaRDI portal
(Redirected from Publication:1302575)
Recommendations
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Minimising earliness and tardiness on parallel machines with sequence-dependent setups
- Earliness-tardiness scheduling with setup considerations
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Cited in
(28)- Hierarchical production planning and scheduling in a multi-product, batch process environment
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- A tabu search algorithm for parallel machine total tardiness problem
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Earliness-tardiness scheduling with setup considerations
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- Minimising earliness and tardiness on parallel machines with sequence-dependent setups
- Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Multi-machine scheduling lower bounds using decision diagrams
- Scheduling job classes on uniform machines
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- A comparison of lower bounds for the single-machine early/tardy problem
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
- Scheduling multiple products on parallel machines with setup costs
- A survey of scheduling problems with setup times or costs
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- Dynamic routing strategies for JIT production in hybrid flow shops
This page was built for publication: Early/tardy scheduling with sequence dependent setups on uniform parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302575)
