Using Simulated Annealing for Open Shop Scheduling with Sum Criteria

Andresen, Michael; Bräsel, Heidemarie; Plauschin, Mathias; Werner, Frank; Magdeburg, Otto-von-Guericke-Universität

doi:10.5772/5572

Cited by 7 publications

(2 citation statements)

References 27 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Andresen et al [93] discussed the application of simulated annealing to open shop scheduling problems with the objective of minimizing total weighted tardiness subject to given release dates.…”

Section: Simulated Annealing Algorithmmentioning

confidence: 99%

Literature Review of Open Shop Scheduling Problems

Anand¹,

Panneerselvam²

2015

IIM

View full text Add to dashboard Cite

This paper discusses review of literature of open shop scheduling problems. First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimization of total tardiness of all jobs, minimization of sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem. In each category, the literature is further classified based on approaches used and then the contributions of researchers in the respective categories are presented. Directions for future research are discussed in the end.

show abstract

Section: Simulated Annealing Algorithmmentioning

confidence: 99%

Literature Review of Open Shop Scheduling Problems

Anand¹,

Panneerselvam²

2015

IIM

View full text Add to dashboard Cite

show abstract

“…It has practical values, for example, in manufacturing, service industries, communications and critical facility assignments, see (Andresen et al 2008) for the references.…”

mentioning

confidence: 99%

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

Andresen

Dhamala

2012

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

We consider the problem of minimizing the makespan in open shop scheduling. The decision problem whether a given sequence in open shop scheduling is irreducible has already been considered, however, has not been solved yet. A sequence is an acyclic orientation of the Hamming graph K n × K m . Irreducible sequences in open shop are the local optimal elements. We present two variants of algorithms based on the specific properties of the H-comparability graph. The first is polynomial whereas the second is exponential. The irreducibility is co-NP. The stated properties argue whether it belongs to P . The complexity status of the considered decision problem is updated.

show abstract

Simulated Annealing Algorithms for the Heterogeneous Robots Task Scheduling Problem in Heterogeneous Robotic Order Fulfillment Systems

Wang

Chen

2022

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

Using Simulated Annealing for Open Shop Scheduling with Sum Criteria

Cited by 7 publications

References 27 publications

Literature Review of Open Shop Scheduling Problems

Literature Review of Open Shop Scheduling Problems

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

Simulated Annealing Algorithms for the Heterogeneous Robots Task Scheduling Problem in Heterogeneous Robotic Order Fulfillment Systems

Contact Info

Product

Resources

About