Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
From MaRDI portal
Publication:337323
DOI10.1016/j.cor.2014.08.020zbMath1348.90237OpenAlexW2078078929MaRDI QIDQ337323
José Manuel Tamarit, Ramón Alvarez-Valdés, Fulgencia Villa
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.08.020
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window, An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics, Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem, Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, Modeling and solving a bi-objective airport slot scheduling problem, SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Just-in-time systems.
- Scheduling around a small common due date
- The complexity of scheduling job families about a common due date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Parallel machine earliness and tardiness scheduling with proportional weights
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
- Exponential neighborhood search for a parallel machine scheduling problem
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Sequencing with Earliness and Tardiness Penalties: A Review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates