The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
From MaRDI portal
Publication:924888
DOI10.1016/j.orl.2007.01.007zbMath1138.90398OpenAlexW1984983586MaRDI QIDQ924888
Publication date: 29 May 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/1038
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
Unbounded parallel-batch scheduling with family jobs and delivery coordination ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities
Cites Work
- Unnamed Item
- Unnamed Item
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Scheduling a batching machine
- Minimizing makespan with release times on identical parallel batching machines
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling a single batch processing machine with non-identical job sizes
This page was built for publication: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan