Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
From MaRDI portal
Publication:336752
DOI10.1016/j.cor.2013.08.003zbMath1348.90278OpenAlexW1986806847MaRDI QIDQ336752
GH. M. Komaki, Amin Aalaei, Vahid Kayvanfar, Mostafa Zandieh
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.2013.08.003
makespanunrelated parallel machinesjust-in-timecontrollable processing timestotal earliness and tardiness
Related Items (11)
A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ An exact quadratic programming approach based on convex reformulation for seru scheduling problems ⋮ Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ Integrated truck and workforce scheduling to accelerate the unloading of trucks ⋮ A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ Throughput optimization for the Robotic Cell Problem with Controllable Processing Times ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
- Total absolute deviation of job completion times on uniform and unrelated machines
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory
- Scheduling parallel CNC machines with time/cost trade-off considerations
- Scheduling unrelated parallel machines with sequence-dependent setups
- A survey of results for sequencing problems with controllable processing times
- A state-of-the-art review of parallel-machine scheduling research
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Parallel machine match-up scheduling with manufacturing cost considerations
- Just-in-time scheduling with controllable processing times on parallel machines
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- Multiple-machine scheduling with earliness, tardiness and completion time penalties
- Parallel machine scheduling with earliness and tardiness penalties
- Two parallel machine sequencing problems involving controllable job processing times
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Parallel machine earliness and tardiness scheduling with proportional weights
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Parallel machine scheduling models with fuzzy processing times
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- A survey of scheduling with controllable processing times
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Single machine scheduling with common due date and controllable processing times
- An anticipative scheduling approach with controllable processing times
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment
- Sequencing with Earliness and Tardiness Penalties: A Review
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- The Total Tardiness Problem: Review and Extensions
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
This page was built for publication: Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
