Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
From MaRDI portal
Publication:1652061
DOI10.1016/j.cor.2016.08.015zbMath1391.90236OpenAlexW2512976471MaRDI QIDQ1652061
Joseph Y.-T. Leung, José Elias Claudio Arroyo
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.locus.ufv.br/handle/123456789/22105
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (15)
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ Integrated scheduling on parallel batch processing machines with non-identical capacities ⋮ Scheduling unrelated additive manufacturing machines with practical constraints ⋮ Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study ⋮ Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Exact algorithms to minimize makespan on single and parallel batch processing machines ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Processing time generation schemes for parallel machine scheduling problems with various correlation structures
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Scheduling a batching machine
- Unrelated parallel machine scheduling using local search
- 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
- Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
