This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph-<span style="font-family:;" "=""> </span&...This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph-<span style="font-family:;" "=""> </span><span style="font-family:Verdana;">based and sequence-based, of the well-known scheduling problem<img src="Edit_41010f25-7ca5-482c-89be-790fad4616e1.png" alt="" /></span><span style="font-family:Verdana;text-align:justify;">. Two upper bounds of job completion times are introduced. A numerical test result analysis is conducted with a two-fold objective 1) testing the performance of each solving methods, and 2) identifying and analyzing the tractability of an instance according to the instance structure in terms of the number of machines, of the jobs setup time lengths and of the jobs release date distribution over the scheduling horizon.</span> <div> <span style="font-family:Verdana;text-align:justify;"><br /> </span> </div>展开更多
In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We no...In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We note that total customer demands for each type should be satisfied, and total required production time in each cell cannot exceed the capacity of the cell. This problem is formulated as an integer programming model and an interface is designed to provide integrity between data and software. Mathematical model is tested by both randomly generated data set and real-world data set from a factory that produce automotive components. As a result of this study, the solution which gives the best alternative production schedule is obtained.展开更多
文摘This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph-<span style="font-family:;" "=""> </span><span style="font-family:Verdana;">based and sequence-based, of the well-known scheduling problem<img src="Edit_41010f25-7ca5-482c-89be-790fad4616e1.png" alt="" /></span><span style="font-family:Verdana;text-align:justify;">. Two upper bounds of job completion times are introduced. A numerical test result analysis is conducted with a two-fold objective 1) testing the performance of each solving methods, and 2) identifying and analyzing the tractability of an instance according to the instance structure in terms of the number of machines, of the jobs setup time lengths and of the jobs release date distribution over the scheduling horizon.</span> <div> <span style="font-family:Verdana;text-align:justify;"><br /> </span> </div>
文摘In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We note that total customer demands for each type should be satisfied, and total required production time in each cell cannot exceed the capacity of the cell. This problem is formulated as an integer programming model and an interface is designed to provide integrity between data and software. Mathematical model is tested by both randomly generated data set and real-world data set from a factory that produce automotive components. As a result of this study, the solution which gives the best alternative production schedule is obtained.
