Scheduling Jobs with Piecewise Linear Decreasing Processing Times

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Cheng, T. C. E., DING, Qing, Kovalyov, M.Y, Bachman, A., Janiak, A.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2003
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/870
https://doi.org/10.1002/nav.10073
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Similar Items