In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The investigated models are very close to the actual scheduling problems, because they envisage the flexible job shop environments, heads , set-up times , arbitrary number of unavailability periods on all resources, arbitrary number of work-centers , any kind of cross-ability, any kind of resume-ability and several types of performance measures . The proposed model is presented to solve two-job problems because it is a graphical approach. However, it is concluded that the idea can be extended to n-dimensional problems as well.

background or methods

http://jiei.azad.ac.ir/article_511057_811118e04aabd2a9afd818207cd0074e.pdf

Generalization of Akers’ Two-Dimensional Job Shop Scheduling Model to J Dimensions

Citations

Flexible job shop scheduling under availability constraints

Related Papers (5)

Job-shop scheduling with approximate methods

A linear time approximation scheme for the job shop scheduling problem

New nonstandard job shop scheduling algorithm

A genetic algorithm for solving classical job shop scheduling problems

Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach