Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
From MaRDI portal
Publication:2676401
Recommendations
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- Flowshop scheduling with interstage job transportation
- Hybrid flowshop scheduling with interstage job transportation
- Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1
- Solving the continuous flow-shop scheduling problem by metaheuristics.
Cites work
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- A study of integer programming formulations for scheduling problems
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
- An Improved Formulation for the Job-Shop Scheduling Problem
- An MILP for scheduling problems in an FMS with one vehicle
- Control of systems integrating logic, dynamics, and constraints
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
- Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints
- Integrated production and material handling scheduling using mathematical programming and constraint programming
- Job Shop Scheduling by Simulated Annealing
- Job-shop scheduling - using component packing and simulated annealing approach
- Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Mathematical programming formulations for machine scheduling: A survey
- Mixed integer programming models for job shop scheduling: A computational analysis
- Optimal scheduling for flexible job shop operation
- Optimization by simulated annealing
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- The Complexity of Flowshop and Jobshop Scheduling
- The job shop scheduling problem: Conventional and new solution techniques
- The schedule-sequencing problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Two simulated annealing-based heuristics for the job shop scheduling problem
Cited in
(6)- scientific article; zbMATH DE number 6686695 (Why is no real title available?)
- A hybrid genetic algorithm based on reinforcement learning for the energy-aware production scheduling in the photovoltaic glass industry
- Scheduling in manufacturing with transportation: classification and solution techniques
- Offline reinforcement learning for learning to dispatch for job shop scheduling
- Robotic flow shop scheduling problem with combined buffer conditions
- Job-shop scheduling problem with limited input buffers: mathematical models and solution methods
This page was built for publication: Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676401)
