Skip Navigation

IMA Journal of Management Mathematics 1999 10(1):15-26; doi:10.1093/imaman/10.1.15
© 1999 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by HUANG, W.
Right arrow Articles by ZHANG, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An O(n2) algorithm for a controllable machine scheduling problem

WANZHEN HUANG and FENG ZHANG

Department of Mathematics and Statistics, School of Mathematical Sciences, Lakehead University Ontario, Canada, P7B 5E1
Department of Applied Mathematics, Shanghai Second Polytechnic University P. R. China

A single-machine scheduling problem with controllable processing times is discussed in this paper. For some jobs, the processing time can be crashed up to u units of time with the additional cost c per unit of time crashed. The object is to find an optimal processing sequence as well as crash activities to minimize total costs of completion and crash. This problem is shown to be polynomially solvable, and an O(n2) algorithm is given together with the theoretical proof.

Keywords: Single-machine scheduling problems; controllable processing times; crash activities; polynomial-time algorithm


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.