A bicriteria two-machine permutation flowshop problem

Sivrikaya-Şerifoğlu, Funda; Ulusoy, Gündüz

doi:10.1016/s0377-2217(97)00338-x

Cited by 42 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Studies that dealt with the F 2 ka C max + b P C i problem (where there is no weight associated with flow time) include Daniel and Chambers [25], Nagar et al [80], Sivrikaya-Serifoglu and Ulusoy [104], Yeh [115], Chou and Lee [23], Yeh [116], Allahverdi [2], and Lin and Wu [66]. However, we found no study that have investigated the F 2 kaC max + b P w i C i problem.…”

Section: Objects With Preferred Presentation Prioritiesmentioning

confidence: 89%

“…The non-weighted version of this problem is denoted as the F 2 kLex( P C i /C max ) and has been proven to be strongly NP-hard by Chen and Bulfin [22]. Several studies have proposed different strategies to solve the problem by approximation or numerical schemes, including Rajendran [91], Sivrikaya-Serifoglu and Ulusoy [104], Gupta et al [36], Gupta et al [35], Gupta et al [37], Neppalli et al [83], T'kindt et al [111], and Ravindran et al [94]. There are no previous studies proposing solutions for the problem when the completion time is weighted.…”

Section: Objects With Preferred Presentation Prioritiesmentioning

confidence: 99%

See 1 more Smart Citation

Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries

Lin

Lai

Hong

2008

Data & Knowledge Engineering

View full text Add to dashboard Cite

Section: Objects With Preferred Presentation Prioritiesmentioning

confidence: 89%

Section: Objects With Preferred Presentation Prioritiesmentioning

confidence: 99%

Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries

Lin

Lai

Hong

2008

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…There were some attempts in the past to develop exact algorithms to minimise the maximum lateness considering mostly single machines, and sometimes two-machines and m-machines (e.g., Smith, 1956;Townsend, 1977;Grabowski, 1980). There exist some exact methods to solve the two-machine and m-machine permutation flowshops with two objectives (e.g., Selen and Hott, 1986;Wilson, 1989;Daniels and Chambers, 1990;Rajendran, 1992;Ulungu and Teghem, 1995;Sivrikaya-Serifoglu and Ulusoy, 1998;Cheng and Shakhlevich, 1999;Sayin and Karabati, 1999;Lemesre et al, 2007; also see T'Kindt and Billaut (2002), for a comprehensive treatment of multi-objective scheduling, in general). It appears that the multi-objective flowshop scheduling problems have not been explored much, and exact approaches to solve multi-objective optimisation problems in scheduling are quite uncommon.…”

Section: Introductionmentioning

confidence: 99%

Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives

Madhushini¹,

Rajendran

2011

EJIE

View full text Add to dashboard Cite

This paper presents branch-and-bound algorithms developed for an m-machine permutation flowshop to minimise the maximum weighted flowtime/maximum weighted tardiness/maximum sum of weighted flowtime and weighted tardiness/maximum sum of weighted flowtime, weighted tardiness and weighted earliness of a job, where each of the objectives is considered separately. A job-based bound, integrated with a machine-based bound, on the completion time of every unscheduled job by considering each of these objectives is developed, and the overall lower bound on a given objective at a given node in the branching tree is obtained by solving a bottleneck assignment problem. The proposed algorithms are evaluated by solving problems of various sizes, and some of these branch-and-bound algorithms (with the consideration of the maximum flowtime/the maximum tardiness) are compared with the existing algorithms available in the literature. This paper also presents the development and computational performance evaluation of a multi-objective branch-and-bound algorithm which can handle various combinations of objectives involving the sum of/maximum weighted flowtime, weighted tardiness and weighted earliness of jobs. [Keywords: permutation flowshop; branch-and-bound algorithm; weighted flowtime; weighted tardiness; weighted earliness; Pareto-optimal solutions; non-dominated solutions; lower bound and upper bound.Reference to this paper should be made as follows: Madhushini, N. and Rajendran, C. (2011) 'Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives', European J.

show abstract

“…They provided a proof to show that for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal. Sivrikaya et al [20] developed three branch and bound approaches (forward, backward, and double-sided approaches) to bicriteria two-machine permutation flowshop problems to minimize weighted combination of average flowtime and makespan. Sayin and Karabati [21] studied the bicriteria scheduling problem of minimizing makespan and sum of completion times simultaneously in a 2-machine flowshop environment.…”

Section: Introductionmentioning

confidence: 99%

A Generalized Algorithm for Solving Multicriteria Scheduling Problems

Oyetunji

Oluleye

2011

AMR

View full text Add to dashboard Cite

In this paper, the scheduling problem involving optimization of multiple criteria (or objectives) is explored. There are many variants of the problem. The particular variant, in which the objectives are aggregated into a scalar function (with each criterion having weight which denotes its relative importance), is considered. An algorithm which can be used to solve very large classes of the multicriteria scheduling problem is proposed. The proposed algorithm and two solution methods selected from the literature were evaluated on a total of 900 randomly generated multicriteria scheduling problems (ranging from 10 to 500 jobs). Two variants of the release dates (0 – 24 and 0 – 49) are utilized. Results show that the proposed algorithm performed better than the selected solution methods when the total completion time criterion is much more important than the other criteria. However, when the total completion time criterion is much less important than the other criteria, the selected solution methods outperformed the proposed algorithm. The results are consistent under the two variants of the release dates.

show abstract

A bicriteria two-machine permutation flowshop problem

Cited by 42 publications

References 16 publications

Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries

Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries

Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives

A Generalized Algorithm for Solving Multicriteria Scheduling Problems

Contact Info

Product

Resources

About