Journal
SWARM AND EVOLUTIONARY COMPUTATION
Volume 44, Issue -, Pages 913-926Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.swevo.2018.10.003
Keywords
Iterated greedy algorithm; Order scheduling; Ready times
Funding
- Ministry of Science and Technology (MOST) of Taiwan [MOST 105-2221-E-035-053-MY3, MOST 106-2816-H-035-001]
Ask authors/readers for more resources
The customer order scheduling problem is becoming a major topic in the research community, but the research regarding customer order scheduling problems with ready times remains relatively limited. This study examined an order scheduling problem with ready times where the measurement criterion was minimizing the total weighted completion time of all the given orders. To solve this intractable problem, we first derived several dominance rules and two lower bounds to use in a branch-and-bound method for finding an exact solution. We then modified five existing heuristics and adopted an iterative greedy (IG) algorithm to determine a near-optimal solution. Specifically, we used a fixed proportion of destruction and a linear function of destruction in the IG algorithm. Pairwise improvement was applied to all the proposed heuristics to achieve high-quality solutions, and we performed one-way analysis of variance and Fisher's least significant difference tests to evaluate and compare the performance of all the proposed algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available