| Titre : | Minmax scheduling problems with common flow-allowance (2012) |
| Auteurs : | B. Mor, Auteur ; Mosheiov, G., Auteur |
| Type de document : | Article : texte imprimé |
| Dans : | Journal of the operational research society (JORS) (Vol. 63 N° 9, Septembre 2012) |
| Article en page(s) : | pp. 1284–1293 |
| Note générale : | Operational research |
| Langues : | Anglais |
| Index. décimale : | 001.424 |
| Tags : | Scheduling Due-date assignment Flow-allowance Minmax |
| Résumé : | In due-date assignment problems with a common flow-allowance, the due-date of a given job is defined as the sum of its processing time and a job-independent constant. We study flow-allowance on a single machine, with an objective function of a minmax type. The total cost of a given job consists of its earliness/tardiness and its flow-allowance cost components. Thus, we seek the job schedule and flow-allowance value that minimize the largest cost among all the jobs. Three extensions are considered: the case of general position-dependent processing times, the model containing an explicit cost for the due-dates, and the setting of due-windows. Properties of optimal schedules are fully analysed in all cases, and all the problems are shown to have polynomial time solutions. |
| DEWEY : | 001.424 |
| ISSN : | 0160-5682 |
| En ligne : | http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011135a.html |
