Article ID: | iaor201111462 |
Volume: | 39 |
Issue: | 7 |
Start Page Number: | 1601 |
End Page Number: | 1604 |
Publication Date: | Jul 2012 |
Journal: | Computers and Operations Research |
Authors: | Mosheiov Gur, Oron Daniel |
Keywords: | scheduling, combinatorial optimization |
In various real life scheduling systems job processing times vary according to the number of jobs previously processed. The vast majority of studies assume a restrictive functional form to describe job processing times. In this note, we address a scheduling problem with the most general job processing time functions. The machine setting assumed is an