Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
From MaRDI portal
Publication:622134
DOI10.1016/j.cor.2010.08.018zbMath1205.90130OpenAlexW2039112427MaRDI QIDQ622134
John W. Fowler, Yang-Kuei Lin, Michele E. Pfund
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.018
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (16)
A multi-objective memetic algorithm for the job-shop scheduling problem ⋮ A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem ⋮ An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ Wave order picking under the mixed-shelves storage strategy: a solution method and advantages ⋮ A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times ⋮ Analysis of the similarities and differences of job-based scheduling problems ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling on parallel identical machines to minimize total tardiness
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Parallel machine scheduling with earliness and tardiness penalties
- A heuristic for the single machine tardiness problem
- Unrelated parallel machine scheduling using local search
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
- A PTAS for the average weighted completion time problem on unrelated machines.
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Heuristics for scheduling in a flow shop with multiple processors
- A decomposition algorithm for the single machine total tardiness problem
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Heuristics for scheduling unrelated parallel machines
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Improved approximation schemes for scheduling unrelated parallel machines
- Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
- An effective heuristic for minimising makespan on unrelated parallel machines
- Convex programming for scheduling unrelated parallel machines
- Algorithms for Scheduling Tasks on Unrelated Processors
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- Solving Parallel Machine Scheduling Problems by Column Generation
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- The Logic of Inductive Inference
- Scheduling
- Approximating scheduling unrelated parallel machines in parallel
This page was built for publication: Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
