Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
From MaRDI portal
Publication:2158015
Recommendations
- Parallel batching with multi-size jobs and incompatible job families
- Scheduling batch processing machines with incompatible job families
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
- A combination of flow shop scheduling and the shortest path problem
- A survey of scheduling with parallel batch (p-batch) processing
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- An Application of Bin-Packing to Multiprocessor Scheduling
- Arc-flow approach for single batch-processing machine scheduling
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Column generation for minimizing total completion time in a parallel-batching environment
- Combination of parallel machine scheduling and vertex cover
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Proximity search for 0--1 mixed-integer convex programming
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Scheduling with batching: A review
- Scheduling. Theory, algorithms, and systems
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- Solving binary cutting stock problems by column generation and branch- and-bound
- Solving the serial batching problem in job shop manufacturing systems
- The Batch Loading and Scheduling Problem
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
Cited in
(7)- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Scheduling batch processing machines with incompatible job families
- Stochastic scheduling of a batch processing machine with incompatible job families
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
This page was built for publication: Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158015)
