Mixed batch scheduling on identical machines
From MaRDI portal
Publication:2197328
DOI10.1007/s10951-019-00623-9zbMath1446.90086OpenAlexW2972659903MaRDI QIDQ2197328
Jun-Qiang Wang, Zhixin Liu, Guo-Qiang Fan
Publication date: 31 August 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-019-00623-9
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Single machine batch scheduling with two non-disjoint agents and splitable jobs ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- Batch scheduling with deteriorating jobs to minimize the total completion time
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
- Serial batch scheduling on uniform parallel machines to minimize total completion time
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- A coordination mechanism for a scheduling game with parallel-batching machines
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Batch sizing and job sequencing on a single machine
- Batch scheduling of step deteriorating jobs
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- The complexity of one-machine batching problems
- Batching identical jobs
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Cost allocation in rescheduling with machine unavailable period
- Batch-processing scheduling with setup times
- Scheduling with batching: A review
- Unbounded parallel-batch scheduling with drop-line tasks
- Minimizing total completion time on a batch processing machine with job families
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- 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
- Scheduling batch processing machines with incompatible job families
- Scheduling Groups of Jobs on a Single Machine
- A review of planning and scheduling systems and methods for integrated steel production
This page was built for publication: Mixed batch scheduling on identical machines
