This paper studies a single machine scheduling problem with time-dependent learning and setup times. Time-dependent learning means that the actual processing time of a job is a function of the sum of the normal proces...This paper studies a single machine scheduling problem with time-dependent learning and setup times. Time-dependent learning means that the actual processing time of a job is a function of the sum of the normal processing times of the jobs already scheduled. The setup time of a job is proportional to the length of the already processed jobs, that is, past-sequence-dependent (psd) setup time. We show that the addressed problem remains polynomially solvable for the objectives, i.e., minimization of the total completion time and minimization of the total weighted completion time. We also show that the smallest processing time (SPT) rule provides the optimum sequence for the addressed problem.展开更多
In this article, a multi-product inventory routing problem is studied. One-depot and many retailers in a finite time period are considered, and split delivery is allowed as well for the addressed problem. The objectiv...In this article, a multi-product inventory routing problem is studied. One-depot and many retailers in a finite time period are considered, and split delivery is allowed as well for the addressed problem. The objective is to minimize the overall cost including vehicle cost, inventory holding cost and transportation cost while the delivery schedule and the quantity of each product for each retailer have to be decided simultaneously. A mathematical model is presented for solving the addressed optimally and example is illustrated as well.展开更多
文摘This paper studies a single machine scheduling problem with time-dependent learning and setup times. Time-dependent learning means that the actual processing time of a job is a function of the sum of the normal processing times of the jobs already scheduled. The setup time of a job is proportional to the length of the already processed jobs, that is, past-sequence-dependent (psd) setup time. We show that the addressed problem remains polynomially solvable for the objectives, i.e., minimization of the total completion time and minimization of the total weighted completion time. We also show that the smallest processing time (SPT) rule provides the optimum sequence for the addressed problem.
文摘In this article, a multi-product inventory routing problem is studied. One-depot and many retailers in a finite time period are considered, and split delivery is allowed as well for the addressed problem. The objective is to minimize the overall cost including vehicle cost, inventory holding cost and transportation cost while the delivery schedule and the quantity of each product for each retailer have to be decided simultaneously. A mathematical model is presented for solving the addressed optimally and example is illustrated as well.
