Scheduling Jobs with Piecewise Linear Decreasing Processing Times

• المؤلفون الرئيسيون: Cheng, T. C. E., DING, Qing, Kovalyov, M.Y, Bachman, A., Janiak, A.
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2003
• الموضوعات: Business
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/870; https://doi.org/10.1002/nav.10073
• المؤسسة: Singapore Management University

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job complet...