Minimizing makespan on a single batch processing machine with nonidentical job sizes
From MaRDI portal
Publication:2741217
DOI10.1002/nav.4zbMath1027.90041OpenAlexW2150171969MaRDI QIDQ2741217
No author found.
Publication date: 9 September 2001
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.4
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (37)
A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services ⋮ Optimally competitive list batching ⋮ Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times ⋮ A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes ⋮ Integrated production and delivery on parallel batching machines ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes ⋮ An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes ⋮ Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ Online scheduling with delivery time on a bounded parallel batch machine with limited restart ⋮ Minimising makespan for two batch-processing machines with non-identical job sizes in job shop ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine ⋮ Exact algorithms to minimize makespan on single and parallel batch processing machines ⋮ Approximation schemes for scheduling a batching machine with nonidentical job size ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Mixed batch scheduling on identical machines ⋮ Integrated scheduling on a batch machine to minimize production, inventory and distribution costs ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan ⋮ Integrated optimization of material supplying, manufacturing, and product distribution: models and fast algorithms ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes ⋮ SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ Minimizing makespan on a single batching machine with release times and non-identical job sizes ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ Minimizing the makespan on a single parallel batching machine ⋮ Single machine batch scheduling with two non-disjoint agents and splitable jobs ⋮ Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs ⋮ A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan ⋮ A note on minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ Capacitated vehicle routing problem on line with unsplittable demands ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes ⋮ On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line
Cites Work
- Unnamed Item
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- Scheduling with agreeable release times and due dates on a batch processing machine
- Minimizing total completion time on a batch processing machine with job families
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a single batch processing machine with non-identical job sizes
This page was built for publication: Minimizing makespan on a single batch processing machine with nonidentical job sizes
