Mixed batch scheduling on identical machines
From MaRDI portal
Publication:2197328
Recommendations
Cites work
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
- A coordination mechanism for a scheduling game with parallel-batching machines
- A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
- A review of planning and scheduling systems and methods for integrated steel production
- Batch scheduling of step deteriorating jobs
- Batch scheduling with deteriorating jobs to minimize the total completion time
- Batch sizing and job sequencing on a single machine
- Batch-processing scheduling with setup times
- Batching identical jobs
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan
- Cost allocation in rescheduling with machine unavailable period
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Minimizing total completion time on a batch processing machine with job families
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- Scheduling a batching machine
- 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
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling with batching: A review
- Serial batch scheduling on uniform parallel machines to minimize total completion time
- The complexity of one-machine batching problems
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Unbounded parallel-batch scheduling with drop-line tasks
Cited in
(13)- Sequential scheduling on identical machines
- Single machine batch scheduling with two non-disjoint agents and splitable jobs
- A survey of scheduling with parallel batch (p-batch) processing
- Interval scheduling on identical machines
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
- Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities
- Online scheduling on a parallel-batch machine with pulse interruptions
- Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints
- Bounded mixed batch scheduling with job release dates and rejection
- Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions
- Mixed batch scheduling with non-identical job sizes to minimize makespan
- Submodular batch scheduling on parallel machines
This page was built for publication: Mixed batch scheduling on identical machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197328)
