Scheduling batches with simultaneous job processing for two-machine shop problems
From MaRDI portal
Recommendations
Cites work
- Batch sizing and job sequencing on a single machine
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Minimizing total completion time on a batch processing machine with job families
- Open Shop Scheduling to Minimize Finish Time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a batching machine
- 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
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- The complexity of one-machine batching problems
- V-shop scheduling
Cited in
(26)- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Scheduling incompatible tasks on two machines
- Complexity of flow shop scheduling problems with transportation constraints
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Scheduling with batching: A review
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Single-machine batch scheduling with job processing time compatibility
- MIP formulations and heuristics for solving parallel batching problems
- Unbounded parallel-batching scheduling with two competitive agents
- Scheduling batches with sequential job processing for two-machine flow and open shops
- No-wait scheduling problems with batching machines
- Two-stage flowshop scheduling problems with identical and batch processors
- A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
- Single machine scheduling with batch delivery to multiple customers in a star-shaped network
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
- Scheduling a proportionate flow shop of batching machines
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
- Batching decisions for assembly production systems
- Makespan minimization in a no-wait flow shop problem with two batching machines
- A note on the complexity of flow shop scheduling with transportation constraints
- Time slot scheduling of compatible jobs
- Flowshop scheduling problem with a batching machine and task compatibilities
This page was built for publication: Scheduling batches with simultaneous job processing for two-machine shop problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932282)