Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
From MaRDI portal
(Redirected from Publication:337323)
Recommendations
- Minimising earliness and tardiness on parallel machines with sequence-dependent setups
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
- Parallel machine earliness and tardiness scheduling with proportional weights
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
Cites work
- scientific article; zbMATH DE number 31717 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Exponential neighborhood search for a parallel machine scheduling problem
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Just-in-time systems.
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine earliness and tardiness scheduling with proportional weights
- Scatter search
- Scheduling around a small common due date
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Sequencing with Earliness and Tardiness Penalties: A Review
- The complexity of scheduling job families about a common due date
Cited in
(12)- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
- Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness
- Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
- A multi-agent system for the weighted earliness tardiness parallel machine problem
- Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
- Minimising earliness and tardiness on parallel machines with sequence-dependent setups
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- Modeling and solving a bi-objective airport slot scheduling problem
This page was built for publication: Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337323)
