Single machine scheduling with assignable due dates

Qi, Xinyuan; Yu, Gang; Bard, Jonathan F.

doi:10.1016/s0166-218x(01)00316-x

Cited by 43 publications

(21 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If we look at literature there are many works on single machine scheduling with due date determination. These works can be listed as follows; Kovalyov [55], Gordon and Strusevich [46], Cheng et al [56], Qi et al [57], Gordon et al [43], Li et al [58], Xia et al [53], Allaoua and Osmane [47], Tuong and Soukhal [48].…”

Section: Background and Literature Surveymentioning

confidence: 99%

Proses planlama ve ağırlıklı teslim tarihi atama ile birlikte ağırlıklı çizelgeleme probleminin bazı saf ve melez meta-sezgisel yöntemler ile çözümü

Demir¹,

Erden

2017

SAÜ Fen Bilimleri Enstitüsü Dergisi

View full text Add to dashboard Cite

If we search literature for integrated process planning and scheduling problem and for scheduling with due date assignment problem we can find hundreds of researches made on these problems. But integration of the three important manufacturing functions are not addressed much in the literature. In this study process planning, weighted scheduling and weighted due date assignment functions are integrated and solved using some pure and hybrid metaheuristics. We studied eight shop floors using random, evolutionary strategies, genetic algorithms and some hybrid searches. We tried to observe how search techniques improve solutions as iterations go on and how evolutionary strategies, genetic algorithms and hybrid search performs well compared to the random search. We also observed that hybrid searches are also powerful search techniques as genetic search and evolutionary strategies.Keywords: process planning, weighted scheduling, weighted due date assignment, evolutionary strategies, genetic algorithm, hybrid metaheuristics, random search Proses planlama ve ağırlıklı teslim tarihi atama ile birlikte ağırlıklı çizelgeleme probleminin bazı saf ve melez meta-sezgisel yöntemler ile çözümü ÖZ Entegre süreç planlama ve çizelgeleme probleminin ve entegre teslim tarihi atama ile birlikte çizelgeleme probleminin literatürüne baktığımızda, literatürde bu konularda yüzlerce araştırma bulabiliriz. Fakat, üç önemli üretim fonksiyonlarının entegrasyonu konusu literatürde ele alınmayan bir alandır. Bu çalışmada süreç planlama, ağırlıklı çizelgeleme ve ağırlıklı teslim tarihi atama fonksiyonları entegre edilmiş ve problem bazı saf ve melez meta-sezgisel yöntemler kullanılarak çözülmüştür. Bu çalışmada biz 8 farklı atölyeyi rassal, evrimsel stratejiler, genetic algoritmalar ve bazı melez aramaları kullanarak çalıştık. Biz arama yöntemlerinin çözümü iterasyonlar devam ederken nasıl iyileştirdiğini ve evrimsel stratejiler, genetic algoritmalar ve melez aramaların rassal aramalara göre daha üstün sonuçlar verdiğini gözlemledik. Ayrıca melez aramaların genetic arama ve evrimsel stratejiler gibi güçlü arama teknikleri olduğunu gözlemledik.Anahtar Kelimeler: süreç planlama, ağırlıklı planlama, ağırlıklı teslim tarihi atama, evrimsel stratejiler, genetik algoritma, melez meta-sezgiseller, rassal arama

show abstract

Section: Background and Literature Surveymentioning

confidence: 99%

Proses planlama ve ağırlıklı teslim tarihi atama ile birlikte ağırlıklı çizelgeleme probleminin bazı saf ve melez meta-sezgisel yöntemler ile çözümü

Demir¹,

Erden

2017

SAÜ Fen Bilimleri Enstitüsü Dergisi

View full text Add to dashboard Cite

show abstract

“…, n, of release dates and due dates in the restricted form (r j , d j ) = ((j−1)P/n, jP/n) to be assigned to the n jobs separately, where P is the total processing time of the n jobs. Qi et al [6] studied the general version of the assignable due dates (ADD) in which the due dates to be assigned have no restriction, i.e., the n due dates to be assigned are independent. In this paper, we accept the problem formulation in Qi et al [6].…”

Section: Introductionmentioning

confidence: 99%

“…Qi et al [6] studied the general version of the assignable due dates (ADD) in which the due dates to be assigned have no restriction, i.e., the n due dates to be assigned are independent. In this paper, we accept the problem formulation in Qi et al [6]. Under the assumption of assignable due dates (ADD), the n previously given due dates d 1 , .…”

Section: Introductionmentioning

confidence: 99%

“…By Qi et al [6], the ADD assumption provides more flexibility than the GDD assumption in some applications. Furthermore, an application of the scheduling under ADD assumption in the airline industry was also provided in [6]. For a schedule π of the n jobs J 1 , .…”

Section: Introductionmentioning

confidence: 99%

“…For convenience, we use GDD and ADD to denote the above two scheduling problems, respectively. By Qi et al [6], there is an optimal schedule for ADD so that the due dates are assigned according to the EDD order. Therefore, an optimal solution for the GDD assignment is also optimal for the ADD assignment.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates

Gao

Yuan

2015

Discrete Applied Mathematics

View full text Add to dashboard Cite

a b s t r a c tIn this paper, we study the single machine scheduling to minimize the total earliness and tardiness (i.e., the total deviation) with generalized or assignable due dates. Under the assumption of assignable due dates, the due dates are treated as variables and must be assigned to the individual jobs in a schedule. The assumption of generalized due dates is a special version of assignable due dates, in which the due dates are sequenced in the EDD order and assigned to the jobs by the increasing order of their completion times so that the ith completed job receives the ith due date. The exact complexity of the two problems has been reported open in the literature. We show in this paper that the two problems are unary NP-hard.

show abstract

Maximizing total early work in a distributed two‐machine flow‐shop

Dolgui

Kovalyov

Lin

2022

Naval Research Logistics

View full text Add to dashboard Cite

The problem of maximizing total early work in a two-machine flow-shop, in which n jobs are to be scheduled subject to a common due date d, has been recently studied in the scheduling literature. An O(n 2 d 4 ) time dynamic programming algorithm was presented first for the weighted case, and then for the unweighted case another O(n 2 d 2 ) running time dynamic programming algorithm was proposed and converted into an O ( n 4 𝜀 2 ) time fully polynomial time approximation scheme (FPTAS). By establishing new problem properties, we present an O(nd 2 ) time dynamic programming algorithm and an O ( n 3 𝜀 2) time FPTAS for the unweighted problem. We generalize the problem to a distributed setting of m parallel two-machine flow-shops, develop an O(nd 3m ) time dynamic programming algorithm, an O) time FPTAS, and three integer linear programming (ILP) formulations for it. Computational experiments are conducted to appraise the proposed ILP models.

show abstract

Single machine scheduling with assignable due dates

Cited by 43 publications

References 19 publications

Proses planlama ve ağırlıklı teslim tarihi atama ile birlikte ağırlıklı çizelgeleme probleminin bazı saf ve melez meta-sezgisel yöntemler ile çözümü

Proses planlama ve ağırlıklı teslim tarihi atama ile birlikte ağırlıklı çizelgeleme probleminin bazı saf ve melez meta-sezgisel yöntemler ile çözümü

Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates

Maximizing total early work in a distributed two‐machine flow‐shop

Contact Info

Product

Resources

About