Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
From MaRDI portal
Publication:2158015
DOI10.1016/J.EJOR.2022.03.027OpenAlexW3127727712WikidataQ114184309 ScholiaQ114184309MaRDI QIDQ2158015FDOQ2158015
Authors: Yanyan Li 
Publication date: 22 July 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.02002
Cites Work
- Title not available (Why is that?)
- Scheduling with batching: A review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A combination of flow shop scheduling and the shortest path problem
- Title not available (Why is that?)
- Combination of parallel machine scheduling and vertex cover
- An Application of Bin-Packing to Multiprocessor Scheduling
- Maximum-weight stable sets and safe lower bounds for graph coloring
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
- Scheduling a single batch processing machine with non-identical job sizes
- Proximity search for 0--1 mixed-integer convex programming
- Solving the serial batching problem in job shop manufacturing systems
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Solving binary cutting stock problems by column generation and branch- and-bound
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- The Batch Loading and Scheduling Problem
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Scheduling. Theory, algorithms, and systems
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Column generation for minimizing total completion time in a parallel-batching environment
- A survey of scheduling with parallel batch (p-batch) processing
- Arc-flow approach for single batch-processing machine scheduling
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
Cited In (7)
- Scheduling batch processing machines with incompatible job families
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches
- Stochastic scheduling of a batch processing machine with incompatible job families
- Scheduling jobs with sizes and delivery times on identical parallel batch 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
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)
