A MILP model for an extended version of the flexible job shop problem

DOI10.1007/s11590-013-0669-7zbMath1292.90109arXiv1401.3654OpenAlexW2104517380MaRDI QIDQ2448209

Paulo Feofiloff, Ernesto G. Birgin, Cristina G. Fernandes, Marcio T. I. Oshiro, Everton Luiz De Melo, Débora P. Ronconi

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.3654

zbMATH Keywords

schedulingMIP modelsflexible job shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem ⋮ A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem ⋮ Multipopulation genetic algorithms with different interaction structures to solve flexible job-shop scheduling problems: a network science perspective ⋮ Metaheuristics for the online printing shop scheduling problem ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ A Taxonomy for the Flexible Job Shop Scheduling Problem

Cites Work

• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• A heuristic to schedule flexible job-shop in a glass factory
• Routing and scheduling in a flexible job shop by tabu search
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
• The Complexity of Flowshop and Jobshop Scheduling
• Flexible job-shop scheduling problem under resource constraints

This page was built for publication: A MILP model for an extended version of the flexible job shop problem