Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
From MaRDI portal
Publication:2676401
DOI10.1016/j.cor.2022.105998OpenAlexW4293581711MaRDI QIDQ2676401
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105998
simulated annealing algorithmmathematical modellingjob-shop schedulingconveyor-based continuous flow transporterslimited buffer capacity
Cites Work
- Optimization by Simulated Annealing
- Mixed integer programming models for job shop scheduling: A computational analysis
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Mathematical programming formulations for machine scheduling: A survey
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- An MILP for scheduling problems in an FMS with one vehicle
- The job shop scheduling problem: Conventional and new solution techniques
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
- Control of systems integrating logic, dynamics, and constraints
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- Integrated production and material handling scheduling using mathematical programming and constraint programming
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints
- A study of integer programming formulations for scheduling problems
- Job Shop Scheduling by Simulated Annealing
- An Improved Formulation for the Job-Shop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Job-shop scheduling - using component packing and simulated annealing approach
- Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment
- The Schedule-Sequencing Problem
- Optimal scheduling for flexible job shop operation
