Scheduling UET task systems with concurrency on two parallel identical processors

Brucker, Peter; Knust, Sigrid; Roper, Duncan; Zinder, Yakov

doi:10.1007/s001860000089

Cited by 20 publications

(8 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each one of the three experimental groups, four sets of scheduling problems were involved that each set has different timing constraints and resource requirements for the jobs. The processing time of each job was set from the range of Brucker et al (2000), Chen and Huang (2001a) and the latest deadline of each job is 16. The constants of the energy function, C 1 , C 2 , and C 3 were all set to 1 in this study.…”

Section: Simulation Examples and Experimental Resultsmentioning

confidence: 99%

“…Extensive surveys on the MTS problems were proposed by Drozdowski (1997) and Lee, Lei, and Pinedo (1997). In particular, Brucker, Knust, Roper, and Zinder (2000) and Du and Leung (1989) presented the computational complexity of different MTS problems, and the MTS problems in different shop environments were also demonstrated by Kramer (1995, 1996).…”

Section: Introductionmentioning

confidence: 81%

See 1 more Smart Citation

Dynamic hard-real-time scheduling using genetic algorithm for multiprocessor task with resource and timing constraints

Cheng

Shiau

Huang

et al. 2009

Expert Systems with Applications

View full text Add to dashboard Cite

Section: Simulation Examples and Experimental Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 81%

Dynamic hard-real-time scheduling using genetic algorithm for multiprocessor task with resource and timing constraints

Cheng

Shiau

Huang

et al. 2009

Expert Systems with Applications

View full text Add to dashboard Cite

“…Brucker et al [42] Lee & Cai [141] Lee & Cai [141] Drozdowski & Dell' Olmo [72] Brucker et al [42] Lee & Cai [141] …”

Section: The Optimal Solution Value Is Given Bymentioning

confidence: 97%

Scheduling Algorithms

Brucker

2004

Self Cite

291

168

View full text Add to dashboard Cite

“…[5,[10][11][12][13][14][15]. Meanwhile, mathematically, the HFSPMT is proved to be strongly NP-hard [7,[16][17][18][19]. Thus, the study of the HFSPMT in theory, methodology, and applications has a great significance in both academic and application fields.…”

Section: Introductionmentioning

confidence: 99%

A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks

Zhou

Wang

et al. 2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

As the strongly NP-hard problem, the hybrid flow-shop problem with multiprocessor tasks (HFSPMT) has gained increasing attention due to its academic significance and wide application background. For many heuristics and meta-heuristics to solve the HFSPMT, decoding method is the key element to decode sequences to schedules, which has great effect on the solution quality. To narrow the idle time between the consecutive operations in the processor and to increase the flexibility in selecting processors to schedule the following operations, several rules are proposed to adjust sequences to minimize the makespan of the HFSPMT. Based on the rules, a novel and effective decoding method named forward scheduling (FS) is proposed in this paper for solving the HFSPMT. At each stage, it first decodes the solution according to the nondecreasing order of the jobs' completion times at the previous stage, and then it adjusts the processing order of the jobs dynamically according to the rules to obtain potentially better schedule. Numerical results based on the well-known benchmarks and comparisons with some existing decoding methods demonstrate the effectiveness of the proposed FS decoding method.

show abstract

Scheduling UET task systems with concurrency on two parallel identical processors

Cited by 20 publications

References 0 publications

Dynamic hard-real-time scheduling using genetic algorithm for multiprocessor task with resource and timing constraints

Dynamic hard-real-time scheduling using genetic algorithm for multiprocessor task with resource and timing constraints

Scheduling Algorithms

A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks

Contact Info

Product

Resources

About