Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
From MaRDI portal
Publication:2657417
DOI10.1155/2020/8625849zbMath1459.90092OpenAlexW3110250614MaRDI QIDQ2657417
Publication date: 12 March 2021
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/8625849
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Scheduling a batching machine
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Machine scheduling with an availability constraint and job delivery coordination
- Integrated Scheduling of Production and Distribution Operations
- Supply Chain Scheduling: Batching and Delivery
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling a single batch processing machine with non-identical job sizes
- Improved bounds for batch scheduling with nonidentical job sizes
- Single batch machine scheduling with deliveries
This page was built for publication: Integrated scheduling problem on a single bounded batch machine with an unavailability constraint