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

A note: a due-window assignment problem on parallel identical machines / Mosheiov, G. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 238–241 Titre : A note: a due-window assignment problem on parallel identical machines Type de document : texte imprimé Auteurs : Mosheiov, G., Auteur ; Sarig, A., Auteur Année de publication : 2011 Article en page(s) : pp. 238–241 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Parallel  machines  Earliness–tardiness  Due-window  Assignment  problem Index. décimale : 001.424 Résumé : We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009179a.html [article] A note: a due-window assignment problem on parallel identical machines [texte imprimé] / Mosheiov, G., Auteur ; Sarig, A., Auteur . - 2011 . - pp. 238–241. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 238–241 Mots-clés : Scheduling  Parallel  machines  Earliness–tardiness  Due-window  Assignment  problem Index. décimale : 001.424 Résumé : We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009179a.html

Scheduling a deteriorating maintenance activity on a single machine / Mosheiov, G. in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. Titre : Scheduling a deteriorating maintenance activity on a single machine Type de document : texte imprimé Auteurs : Mosheiov, G., Auteur ; J. B. Sidney, Auteur Année de publication : 2010 Article en page(s) : pp. Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Single-machine  Maintenance  activity  Polynomial-time  solution Index. décimale : 001.424 Résumé : We study a problem of scheduling a maintenance activity on a single machine. Following several recent papers, the maintenance is assumed to be deteriorating, that is, delaying the maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We introduce polynomial time solutions for all these problems. DEWEY : 001.434 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors20095a.html [article] Scheduling a deteriorating maintenance activity on a single machine [texte imprimé] / Mosheiov, G., Auteur ; J. B. Sidney, Auteur . - 2010 . - pp. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. Mots-clés : Scheduling  Single-machine  Maintenance  activity  Polynomial-time  solution Index. décimale : 001.424 Résumé : We study a problem of scheduling a maintenance activity on a single machine. Following several recent papers, the maintenance is assumed to be deteriorating, that is, delaying the maintenance increases the time required to perform it. The following objective functions are considered: makespan, flowtime, maximum lateness, total earliness, tardiness and due-date cost, and number of tardy jobs. We introduce polynomial time solutions for all these problems. DEWEY : 001.434 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors20095a.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