Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm

DOI10.1080/00207721.2014.902553zbMath1333.90052OpenAlexW1985556834WikidataQ57432779 ScholiaQ57432779MaRDI QIDQ2795178

Jun Pei, Ling Wang, Wenjuan Fan, Shan-Lin Yang, Panos M. Pardalos, Xin-Bao Liu

Publication date: 18 March 2016

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2014.902553

zbMATH Keywords

batchingheuristic algorithmrelease timessupply chain schedulingworst case analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Trade models (91B60)

Related Items (6)

Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine ⋮ Book review of: X. Liu et al., Optimization and management in manufacturing engineering. Resource collaborative optimization and management through the internet of things. ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ Multi-objective optimal scheduling of reconfigurable assembly line for cloud manufacturing ⋮ Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities

Cites Work

• Unnamed Item
• Tabu search and lower bounds for a combined production-transportation problem
• Parallel batch scheduling of equal-length jobs with release and due dates
• On-line supply chain scheduling problems with preemption
• Scheduling a hybrid flowshop with batch production at the last stage
• A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
• An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
• Makespan minimization on single batch-processing machine via ant colony optimization
• Minimizing makespan with release times on identical parallel batching machines
• The significance of reducing setup times/setup costs
• Solving single batch-processing machine problems using an iterated heuristic
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• Supply Chain Scheduling: Batching and Delivery
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm