Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
From MaRDI portal
Publication:2022187
DOI10.1007/s10898-018-0707-1zbMath1465.90029OpenAlexW2890784001WikidataQ129207635 ScholiaQ129207635MaRDI QIDQ2022187
Baoyu Liao, Qingru Song, Panos M. Pardalos, Jun Pei, Shan-Lin Yang
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0707-1
parallel machinesstep-deteriorationgroup schedulingoutsourcingserial-batchinginclusive processing set restrictionsplatform enterprise
Related Items (5)
Improved DE search for competing groups scheduling with deterioration effects ⋮ Scheduling of two-machine flowshop with outsourcing lead-time ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Less is more approach for competing groups scheduling with different learning effects ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Cites Work
- Unnamed Item
- Variable neighborhood search for location routing
- 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
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
- Variable neighbourhood search: Methods and applications
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling jobs under simple linear deterioration
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Variable neighborhood search
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- Single machine scheduling with deadlines and increasing rates of processing times
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
- Parallel machine scheduling under a grade of service provision
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Solving the serial batching problem in job shop manufacturing systems
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Single-machine ready times scheduling with group technology and proportional linear deterioration
- Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production
- Single-machine group scheduling problems with deterioration consideration
- 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
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling jobs with piecewise linear decreasing processing times
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
