Identical parallel machine scheduling to minimise makespan and total weighted completion time: a column generation approach

Xu, Jingyang; Nagi, Rakesh

doi:10.1080/00207543.2013.825379

Search citation statements

Order By: Relevance

Paper Sections

Select...

A Pdstsp Heuristic1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2024

Publication Types

Select...

Article6

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 9 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, regarding the PMS problem, Min and Cheng (1999) propose a genetic algorithm and Xu and Nagi (2013) provide an exact approach utilizing column generation.…”

Section: A Pdstsp Heuristicmentioning

confidence: 99%

The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery

Murray

Chu

2015

Transportation Research Part C: Emerging Technologies

1,081

797

View full text Add to dashboard Cite

“…For example, regarding the PMS problem, Min and Cheng (1999) propose a genetic algorithm and Xu and Nagi (2013) provide an exact approach utilizing column generation.…”

Section: A Pdstsp Heuristicmentioning

confidence: 99%

The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery

Murray

Chu

2015

Transportation Research Part C: Emerging Technologies

1,081

797

View full text Add to dashboard Cite

“…From a computational point of view has been tackled by various branch-and-bound methods [ 13 – 17 ], for which determining the optimal solution of instances with 30 or more jobs and two or more identical machines is typically difficult [ 18 ].…”

Section: Introductionmentioning

confidence: 99%

The checkpoint ordering problem

Hungerländer

2017

Optimization

View full text Add to dashboard Cite

We suggest a new variant of a row layout problem: Find an ordering of n departments with given lengths such that the total weighted sum of their distances to a given checkpoint is minimized. The Checkpoint Ordering Problem (COP) is both of theoretical and practical interest. It has several applications and is conceptually related to some well-studied combinatorial optimization problems, namely the Single-Row Facility Layout Problem, the Linear Ordering Problem and a variant of parallel machine scheduling. In this paper we study the complexity of the (COP) and its special cases. The general version of the (COP) with an arbitrary but fixed number of checkpoints is NP-hard in the weak sense. We propose both a dynamic programming algorithm and an integer linear programming approach for the (COP) . Our computational experiments indicate that the (COP) is hard to solve in practice. While the run time of the dynamic programming algorithm strongly depends on the length of the departments, the integer linear programming approach is able to solve instances with up to 25 departments to optimality.

show abstract

A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach

Kouider

Haddadene

2021

Computers & Operations Research

View full text Add to dashboard Cite

Identical parallel machine scheduling to minimise makespan and total weighted completion time: a column generation approach

Cited by 9 publications

References 24 publications

The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery

The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery

The checkpoint ordering problem

A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach

Contact Info

Product

Resources

About