Parallel machine scheduling with a common due window

Chen, Zhi Long; Lee, Chung Yee

doi:10.1016/s0377-2217(01)00068-6

Cited by 63 publications

(32 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to Constraint (19), if job h is processed on machine i immediately after job j ðX jip ¼ 1 and X hiðpþ1Þ ¼ 1Þ, start time of job h on machine i must be greater than completion time of job j on machine i. (20) states that if p'+1th operation job j is on machine k and p'th its operation is on machine i ðY jip 0 ¼ 1 and Y jkðp 0 þ1Þ ¼ 1Þ, job j start time on machine k must be greater than completion time of job j on machine i. ðST ij þ P ij ST kj Þ.…”

Section: Position-based Mathematical Modelmentioning

confidence: 99%

See 1 more Smart Citation

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

Doulabi

Avazbeigi

Arab

et al. 2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

This paper addresses open shop scheduling problem from the viewpoint of just-in-time management in which the objective function is to minimize the sum of weighted earliness/tardiness penalties. The problem is formulated as two different mixed integer linear programming models. To solve the problem, a novel hybrid two-phase algorithm is presented. In the first phase, a simulated annealing is applied to search the appropriate sequences of jobs on machines. Based on the job sequences obtained in the first phase, one of the proposed mathematical formulations can be reduced to a linear programming model and in the second phase by solving the linear programming model, the start time of jobs on machines can be determined. In order to evaluate the quality of solutions, a specific branching strategy is applied in solving the other mathematical model to obtain a lower bound. Computational results show that the algorithm obtains high-quality solutions in reasonable time.

show abstract

Section: Position-based Mathematical Modelmentioning

confidence: 99%

“…Chen and Lee [20] proposed a branch and bound algorithm for finding an optimal schedule of these problems. Chen and Powell [21] presented a column generation based on decomposition algorithm for a parallel machine just-intime scheduling problem.…”

Section: Introductionmentioning

confidence: 99%

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

Doulabi

Avazbeigi

Arab

et al. 2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

show abstract

“…The majority of the literature on JIT scheduling deals with problems with only a single machine. Kramer and Lee (1994), Chen and Lee (2002), Wan and Yen (2002) and Yeung et al (2004) are the few papers that study a multimachine problem with the due window model, and all other multi-machine results consider problems where the due date of a job is only one point of time.…”

Section: Literature Reviewmentioning

confidence: 99%

Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min–max technique

2010

View full text Add to dashboard Cite

In the literature of multi-objective problem, there are different algorithms to solve different optimization problems. This paper presents a min-max multiobjective procedure for a dual-objective, namely make span, and sum of the earliness and tardiness of jobs in due window machine scheduling problems, simultaneously. In formulation of min-max method when this method is combined with the weighting method, the decision maker can have the flexibility of mixed use of weights and distance parameter to yield a set of Pareto-efficient solutions. This research extends the new hybrid metaheuristic (HMH) to solve parallel machines scheduling problems with sequence-dependent setup time that comprises three components: an initial population generation method based on an ant colony optimization (ACO), a simulated annealing (SA) as an evolutionary algorithm employs certain probability to avoid becoming trapped in a local optimum, and a variable neighborhood search (VNS) which involves three local search procedures to improve the population. In addition, two VNS-based HMHs, which are a combination of two methods, SA/VNS and ACO/VNS, are also proposed to solve the addressed scheduling problems. A design of experiments approach is employed to calibrate the parameters. The non-dominated sets obtained from HMH and two best existing bi-criteria scheduling algorithms are compared in terms of various indices and the computational results show that the proposed algorithm is capable of producing a number of high-quality Pareto optimal scheduling plans. Aside, an extensive computational experience is carried out to analyze the different parameters of the algorithm.

show abstract

“…Scheduling problems with due windows have been introduced by Anger, Lee and Martin-Vega [8]. The recent list of publications concerning scheduling problems with fixed or assignable due windows includes the papers of the following authors: Cheng [9], Lee [10], Kramer and Lee [11], Weng and Ventura [12][13][14], Liman and Ramaswamy [15], Mosheiov and Lann [16,17], Koulamas [18], Azizoglu and Webster [19], Wu and Wang [20], Linn, Yen and Zhang [21], Yeung, Oguz and Cheng [22], Yoo and Martin-Vega [23], Chen and Lee [24], Biskup and Feldmann [25], and Wodecki [26]. The due window assignment in scheduling problems with a general sum-type criterion (the most interesting for us) have been considered in the following papers by: Janiak and Marek [27,28], Kramer and Lee [29], and Liman, Panwalker and Thongmee [30,31].…”

Section: Introductionmentioning

confidence: 99%

Single processor scheduling problems with various models of a due window assignment

Janiak¹,

Janiak²,

Marek³

2009

Bulletin of the Polish Academy of Sciences: Technical Sciences

View full text Add to dashboard Cite

Abstract. In the paper we investigate four single processor scheduling problems, which deal with the process of the negotiation between a producer and a customer about delivery time of final products. This process is modeled by a due window, which is a generalization of well known classical due date and describes a time interval, in which a job should be finished. Due window assignment is a new approach, which has been investigated in the scientific literature for a few years. In this paper we consider various models of due window assignment. To solve the formulated problems we have to find such a schedule of jobs and such an assignment of due windows to each job, which minimizes a given criterion dependent on the maximum or total earliness and tardiness of jobs and due window parameters. One of the main results is the mirror image of the solutions of the considered problems and other problems presented in the scientific literature. The wide survey of the literature is also given.

show abstract

Parallel machine scheduling with a common due window

Cited by 63 publications

References 32 publications

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem

Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min–max technique

Single processor scheduling problems with various models of a due window assignment

Contact Info

Product

Resources

About