Documents disponibles écrits par cet auteur

Minmax scheduling problems with common flow-allowance / B. Mor in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1284–1293 Titre : Minmax scheduling problems with common flow-allowance Type de document : texte imprimé Auteurs : B. Mor, Auteur ; Mosheiov, G., Auteur Année de publication : 2012 Article en page(s) : pp. 1284–1293 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Scheduling  Due-date  assignment  Flow-allowance  Minmax Index. décimale : 001.424 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 [article] Minmax scheduling problems with common flow-allowance [texte imprimé] / B. Mor, Auteur ; Mosheiov, G., Auteur . - 2012 . - pp. 1284–1293. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1284–1293 Mots-clés : Scheduling  Due-date  assignment  Flow-allowance  Minmax Index. décimale : 001.424 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

The equal allocation policy in open shop batch scheduling / B. Mor in Journal of the operational research society (JORS), Vol. 63 N° 5 (Mai 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 646–652 Titre : The equal allocation policy in open shop batch scheduling Type de document : texte imprimé Auteurs : B. Mor, Auteur ; Mosheiov, G., Auteur ; D. Oron, Auteur Année de publication : 2012 Article en page(s) : pp. 646–652 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Batch  scheduling  Open  shop  Makespan Index. décimale : 001.424 Résumé : We study the optimality of the very practical policy of equal allocation of jobs to batches in batch scheduling problems on an m-machine open shop. The objective is minimum makespan. We assume unit processing time jobs, machine-dependent setup times and batch availability. We show that equal allocation is optimal for a two-machine and a three-machine open shop. Although, this policy is not necessarily optimal for larger size open shops, it is shown numerically to produce very close-to-optimal schedules. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201164a.html [article] The equal allocation policy in open shop batch scheduling [texte imprimé] / B. Mor, Auteur ; Mosheiov, G., Auteur ; D. Oron, Auteur . - 2012 . - pp. 646–652. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 5 (Mai 2012) . - pp. 646–652 Mots-clés : Batch  scheduling  Open  shop  Makespan Index. décimale : 001.424 Résumé : We study the optimality of the very practical policy of equal allocation of jobs to batches in batch scheduling problems on an m-machine open shop. The objective is minimum makespan. We assume unit processing time jobs, machine-dependent setup times and batch availability. We show that equal allocation is optimal for a two-machine and a three-machine open shop. Although, this policy is not necessarily optimal for larger size open shops, it is shown numerically to produce very close-to-optimal schedules. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n5/abs/jors201164a.html