Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
Explore this paper's citation graph
Summary
A novel two-phase heuristic (TP-H) is developed to solve a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times, and it is shown that TP-H can effectively and efficiently solve large-size problems in a reasonable time.
- Type
- article
- Published
- 2016-03-01
- Cited by
- 21
- References
- 34
- OpenAlex
- https://openalex.org/W1985556834
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:6261973
Keywords
Heuristics, Job shop scheduling, Mathematical optimization, Scheduling (production processes), Computer science
References
- Handbook of Applied Optimization
- Network optimization in supply chain management and financial engineering: An annotated bibliography
- An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes
- Joint cyclic production and delivery scheduling in a two-stage supply chain
- Batch scheduling with step‐deteriorating processing times to minimize flowtime
- Scheduling a hybrid flowshop with batch production at the last stage
- Supply chain scheduling: Sequence coordination
- Solving single batch-processing machine problems using an iterated heuristic
- Minimizing Total Weighted Completion Time on Identical Parallel Batch Machines
- Genetic algorithms for coordinated scheduling of production and air transportation
- Makespan minimization on single batch-processing machine via ant colony optimization
- A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system
- Supply chain scheduling and coordination with dual delivery modes and inventory storage cost
- Tabu search and lower bounds for a combined production-transportation problem
- The significance of reducing setup times/setup costs
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- On-line supply chain scheduling problems with preemption
- Minimizing makespan with release times on identical parallel batching machines
- New worst‐case results for the bin‐packing problem
- A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
Cited by
- SUPPLY CHAIN SCHEDULING FOR MULTI-MACHINES AND MULTI-CUSTOMERS
- Uniform parallel batch machines scheduling considering transportation using a hybrid DPSO-GA algorithm
- Multi-objective optimal scheduling of reconfigurable assembly line for cloud manufacturing
- Mixed production planning in the pharmaceutical supply chain
- An accelerating Benders’ decomposition approach to the integrated supply chain network design with distributed generation
- Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights
- A fault compensation algorithm for a distributed manufacturing system
- A developed genetic algorithm for solving the multi-objective supply chain scheduling problem
- Book Review: Xinbao Liu, Jun Pei, Lin Liu, Hao Cheng, Mi Zhou, and Panos M. Pardalos: Optimization and management in manufacturing engineering. Resource collaborative optimization and management through the Internet of Things. Springer optimization and its applications series
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- Optimization and management in manufacturing engineering: resource collaborative optimization and management through the internet of things
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
- Winner determination problem in multiple automated guided vehicle considering cost and flexibility
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
- Supply Chain Scheduling Method for the Coordination of Agile Production and Port Delivery Operation
- A History of Metaheuristics
- Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities
- Dynamic Coordinated Supply Chain Scheduling in an IoT Environment
- Future Research on Multiobjective Coordinated Scheduling Problems for Discrete Manufacturing Enterprises in Supply Chain Environments
- Reconfigurable Distributed Controller for Welding and Assembly Robotic Systems: Issues and Experiments
Related papers
- A novel approach for obtaining initial basic solution of transportation problem
- Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- On Capacitated Multi-item Inventory Problems
- New heuristics for flow shop problem to minimize makespan
- Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
- The Segregated Storage Problem: Some Properties and an Effective Heuristic
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
- Improved mixed-integer linear programming model and heuristics for bi-objective single-machine batch scheduling with energy cost consideration
- Integration of scheduling and routing for two-echelon supply chain system