Evaluation of mathematical models for flexible job-shop scheduling problems

DOI10.1016/j.apm.2012.03.020zbMath1351.90093OpenAlexW2061950072MaRDI QIDQ350406

S. Kürşat İşleyen, Yunus Demir

Publication date: 7 December 2016

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2012.03.020

zbMATH Keywords

schedulingmixed integer programmingflexible job-shops

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem ⋮ Multipopulation genetic algorithms with different interaction structures to solve flexible job-shop scheduling problems: a network science perspective ⋮ Clarifying cutting and sewing processes with due windows using an effective ant colony optimization ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ Flexible job shop scheduling problem for parallel batch processing machine with compatible job families ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ Integrating preferences within multiobjective flexible job shop scheduling ⋮ A Taxonomy for the Flexible Job Shop Scheduling Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematical programming formulations for machine scheduling: A survey
• Flexible job shop scheduling with overlapping in operations
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• A global MILP model for FMS scheduling
• A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• Modelling and heuristics of FMS scheduling with multiple objectives
• A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs)
• A study of integer programming formulations for scheduling problems
• Principles of Sequencing and Scheduling
• The Complexity of Flowshop and Jobshop Scheduling
• Scheduling in a production environment with multiple process plans per job
• Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment
• The Schedule-Sequencing Problem
• Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem
• Optimal scheduling for flexible job shop operation

This page was built for publication: Evaluation of mathematical models for flexible job-shop scheduling problems