Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 40th Conference on Winter Simulation
Series production in a basic re-entrant shop to minimize makespan or total flow time
Computers and Industrial Engineering
Planning and control of logistics for offshore wind farms
MACMESE'10 Proceedings of the 12th WSEAS international conference on Mathematical and computational methods in science and engineering
Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm
Computers and Industrial Engineering
Mathematical models for preemptive shop scheduling problems
Computers and Operations Research
Efficient methods to schedule reentrant flowshop system
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Hi-index | 0.01 |
This paper describes the development of mixed binary integer programming (BIP) formulations for the reentrant job shop scheduling problem. Based on an earlier classical job shop model developed by Manne and improved by Liao and You, this paper presents two extended BIP optimization formulations for the problem under consideration. In order to improve the solution speed of the BIP formulations, two layer division procedures are developed and incorporated in the corresponding models. Results of computational experiments, in which an average performance of these formulations is investigated, are also reported.