A multi-objective optimization for preemptive identical parallel machines scheduling problem
From MaRDI portal
Publication:2403115
Recommendations
- A multiobjective optimization approach to solve a parallel machines scheduling problem
- A multi-objective optimization model and its algorithm for hybrid parallel machine scheduling problems
- Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
Cites work
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
- A new model for the preemptive earliness-tardiness scheduling problem
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Multi-objective optimization using evolutionary algorithms
- Parallel machine earliness and tardiness scheduling with proportional weights
- Parallel machine scheduling with splitting jobs
- Preemption in single machine earliness/tardiness scheduling
- Preemptive scheduling on identical parallel machines subject to deadlines.
- Preemptive scheduling on uniform machines to minimize mean flow time
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Scheduling with target start times
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Single-machine scheduling with early and tardy completion costs
- Some dominance properties for single-machine tardiness problems with sequence-dependent setup
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
- The one-machine just-in-time scheduling problem with preemption
- The one-machine problem with earliness and tardiness penalties
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
- Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness
Cited in
(7)- Solving multi-objective parallel machine scheduling problem by a modified NSGA-II
- An uncertain parallel machine problem with deterioration and learning effect
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- A multiobjective optimization approach to solve a parallel machines scheduling problem
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines
This page was built for publication: A multi-objective optimization for preemptive identical parallel machines scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2403115)
