An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

Nowicki, Eugeniusz

doi:10.1016/0377-2217(93)90246-j

Cited by 23 publications

(14 citation statements)

References 15 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our algorithms have a worst case performance ratio that is better than the 4/3-approximation algorithm for problem P3 described in Nowicki [15]. Moreover, the linear time complexity of our PTAS for problem P3 is the best possible with respect to the number of jobs.…”

Section: New Resultsmentioning

confidence: 86%

“…When processing times are controllable, to the best of our knowledge, the only known closely related result is due to Nowicki [15]. In [15] the flow shop scheduling problem with controllable processing times is addressed, and a 4/3-approximation algorithm for the flow shop version of problem P3 is described.…”

Section: Known Resultsmentioning

confidence: 99%

“…For a survey of this area until 1990, the reader is referred to [17]. Recent results include [2,3,4,10,14,15,20,22,26].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Approximation schemes for job shop scheduling problems with controllable processing times

Jansen

Mastrolilli

Solis-Oba

2005

European Journal of Operational Research

View full text Add to dashboard Cite

In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial time approximation schemes when the number of machines and the number of operations per job are fixed.

show abstract

Section: New Resultsmentioning

confidence: 86%

Section: Known Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Approximation schemes for job shop scheduling problems with controllable processing times

Jansen

Mastrolilli

Solis-Oba

2005

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…In [64], problem F P |p ij = a ij − u ij , 0 ≤ u ij ≤ β ij |C max + Σv ij u ij was considered. Author proves that the problem is NP-hard and propose some approximation algorithms.…”

Section: Flow Shopmentioning

confidence: 99%

Resource Management in Machine Scheduling Problems: A Survey

Janiak

Lichtenstein

2007

dmms

View full text Add to dashboard Cite

Abstract. The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e., the models in which the job processing time or the job release date is given as a linear or convex function dependent on the amount of the additional resource allotted to the job. The scheduling models with resource dependent processing times or resource dependent release dates extend the classical scheduling models to reflect more precisely scheduling problems that appear in real life. Thus, in this paper we present the computational complexity results and solution algorithms that have been developed for this kind of problems.

show abstract

“…Recently, scheduling problems with controllable machine speeds and job processing times have been considered by several researchers: Alidaee and Ahmadian (1993), Ishii et al (1987), Nowicki (1993), Nowicki and Zdrzalka (1988), Trick (1994), Van Vliet and Wagelmans (1990), Vickson (1980a,b), and Zdrzalka (1991). A survey of the literature can be found in Nowicki and Zdrzalka (1990).…”

Section: Introductionmentioning

confidence: 98%

Flow-line scheduling problem with controllable processing times

Karabatı

Kouvelis

1997

IIE Transactions

View full text Add to dashboard Cite

In this paper we address the simultaneous scheduling and optimal-processing-times selection problem in a multi-product deterministic flow line operated under a cyclic scheduling approach. The selection of processing times plays an important role in achieving the desired production rate with the least possible operating cost. We first formulate the important subproblem of optimal-processing-times selection for different objectives, when the sequence of jobs is fixed, and then develop an efficient solution procedure for it. The fast solution of the fixed sequence problem is necessary for the development of efficient approximate solution procedures for the simultaneous scheduling and optimal-processing-times problem. A computational study on the effectiveness of the proposed solution procedure is presented. For the solution of the simultaneous scheduling and optimal-processing-times problem we suggest an iterative solution procedure. and report our computational experience with this procedure. For the solution of large problems we present a genetic algorithm. The effectiveness of the algorithm is demonstrated through computational results and by evaluating the performance of the obtained solutions against lower bounds that we developed for the problem.

show abstract

An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

Cited by 23 publications

References 15 publications

Approximation schemes for job shop scheduling problems with controllable processing times

Approximation schemes for job shop scheduling problems with controllable processing times

Resource Management in Machine Scheduling Problems: A Survey

Flow-line scheduling problem with controllable processing times

Contact Info

Product

Resources

About