A Mathematical Model for Job Shop Scheduling with Resource Availability Constraints
A common assumption carried by most of the machine scheduling literature is that machines are supposed to be always available to process jobs. However it is not true when a machine breaks down or a preventive maintenance activity is scheduled. It is thus interesting to study the possibility for an operation to be interrupted due to machine unavailability. In this paper we take into account all possible cases for an operation to be interrupted or not by an unavailability period and we present a general mathematical model. In our knowledge there is no study which includes all these cases. In this paper we also introduce flexibility on starting dates of unavailability periods which means that an unavailability period can start in a time window defined by an earliest and a latest starting dates. This flexibility is relevant when scheduling a preventive maintenance. Numerical experiment on generated benchmarks were performed with ILOG CPLEX 10.
Scheduling availability constraints mathematical modeling mixed integer linear programming
Sadia AZEM Riad AGCOUNE Stephane DAUZERE-PERES
Ecole des Mines de Saint-Etienne CMP Georges Charpak Avenue des Anemones Quartier Saint-Pierre F-135 Universite du Luxembourg Faculte des Sciences,de la Technologie et de la Communication 6 rue Richard Ecole des Mines de Saint-Etienne CMP Georges Charpak Avenue des Anemones Quartier Saint-Pierre F-135
国际会议
北京
英文
2007-05-30（万方平台首次上网日期，不代表论文的发表时间）