Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
From MaRDI portal
Publication:829191
DOI10.1007/s10479-020-03555-2zbMath1467.90011OpenAlexW3011585646MaRDI QIDQ829191
Baoyu Liao, Jun Pei, Qingru Song, Panos M. Pardalos, Xin-Bao Liu
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03555-2
Related Items (6)
Improved DE search for competing groups scheduling with deterioration effects ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint ⋮ Sensitivity analysis of the unrelated parallel machine scheduling problem with rework processes and machine eligibility restrictions ⋮ Research on delivery times scheduling with truncated learning effects ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Cites Work
- Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types
- The complexity of scheduling starting time dependent tasks with release times
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- An order scheduling problem with position-based learning effect
- On single processor scheduling problems with learning dependent on the number of processed jobs
- Does inventory pooling improve customer service levels?
- A single-machine scheduling with a truncated linear deterioration and ready times
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
- Competing with bandit supply chains
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- Variable neighbourhood search: methods and applications
- Single-machine scheduling with learning considerations
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- 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
- Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
- Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
- Minimizing makespan with release times on identical parallel batching machines
- A note on single-processor scheduling with time-dependent execution times
- Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
- Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production
- Parallel machine scheduling with machine availability and eligibility constraints
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
- Scheduling Deteriorating Jobs on a Single Processor
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling jobs with piecewise linear decreasing processing times
- Parallel machine scheduling with a learning effect
- Single machine scheduling with learning effect considerations
This page was built for publication: Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
