Scheduling batches with simultaneous job processing for two-machine shop problems
From MaRDI portal
Publication:5932282
DOI<25::AID-JOS58>3.0.CO;2-7 10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7zbMath0979.90117OpenAlexW2022012895MaRDI QIDQ5932282
Vitaly A. Strusevich, Chris N. Potts, Thomas Tautenhahn
Publication date: 27 February 2002
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/1099-1425(200101/02)4:1<25::aid-jos58>3.0.co;2-7
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)
Related Items
Complexity of flow shop scheduling problems with transportation constraints, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, 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, Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time, No-Wait Scheduling Problems with Batching Machines, Unbounded parallel-batch scheduling with family jobs and delivery coordination, MIP formulations and heuristics for solving parallel batching problems, Unbounded parallel-batching scheduling with two competitive agents, Scheduling with batching: A review, Four decades of research on the open-shop scheduling problem to minimize the makespan, Flowshop scheduling problem with a batching machine and task compatibilities, Integrated problem of soaking pit heating and hot rolling scheduling in steel plants, SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK, Batching decisions for assembly production systems, 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 hybrid flowshop with parallel batching machines and compatibilities, TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS, Scheduling a proportionate flow shop of batching machines, Scheduling incompatible tasks on two machines, A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM, Single-machine batch scheduling with job processing time compatibility
Cites Work
- Batch sizing and job sequencing on a single machine
- V-shop scheduling
- Scheduling a batching machine
- The complexity of one-machine batching problems
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Scheduling with batching: A review
- Minimizing total completion time on a batch processing machine with job families
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Open Shop Scheduling to Minimize Finish Time
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling batch processing machines with incompatible job families
- Scheduling Groups of Jobs on a Single Machine
