A permutation flow-shop scheduling problem with convex models of operation processing times

T.C.E. Cheng and A. Janiak

Annals of Operations Research, 2000, vol. 96, issue 1, 39-60

Abstract: The paper is an extension of the classical permutation flow-shop scheduling problem to the case where some of the job operation processing times are convex decreasing functions of the amounts of resources (e.g., financial outlay, energy, raw material) allocated to the operations (or machines on which they are performed). Some precedence constraints among the jobs are given. For this extended permutation flow-shop problem, the objective is to find a processing order of the jobs (which will be the same on each machine) and an allocation of a constrained resource so as to minimize the duration required to complete all jobs (i.e., the makespan). A computational complexity analysis of the problem shows that the problem is NP-hard. An analysis of the structure of the optimal solutions provides some elimination properties, which are exploited in a branch-and-bound solution scheme. Three approximate algorithms, together with the results of some computational experiments conducted to test the effectiveness of the algorithms, are also presented. Copyright Kluwer Academic Publishers 2000

Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018943300630 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:96:y:2000:i:1:p:39-60:10.1023/a:1018943300630

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018943300630

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().