An improved water flow-like algorithm for order acceptance and scheduling with identical parallel machines

Wu, Gen-Han; Cheng, Chen-Yang; Yang, Hong-In; Chena, Chung-Te

doi:10.1016/j.asoc.2017.10.015

Cited by 30 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, using knowledge of the current production schedule when generating new schedules would perform better [27]. Nobibon and Leus studied a problem where a company has to select orders from a pool of firms [34]. However, these research studies were carried out based on order selection from known arrived orders and neglected the dynamic of order arriving.…”

Section: Multiple Orders Acceptance Andmentioning

confidence: 99%

Multiple Precast Component Orders Acceptance and Scheduling

Jiang

Cao

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Precast components manufacturer generally operates under limited production capacity and produces products of one order which may delay another. This paper develops a precast component order acceptance and scheduling model that aims to maximize the total profit in a stochastic multiple orders environment. In that model, the increasing of the overall profit of the precast component manufacturer is achieved by using a heuristic algorithm and a dynamic order acceptance heuristic. Results of numerical examples indicate the proposed model realizes the increasing total profit in most cases comparing to accept all of the orders. Besides, this study tested three order acceptance criteria and found that the profit-based criterion is to be more stable in terms of maximum total profit. This approach is anticipated to provide support to precast component manufacturers when faced with multiple orders in long-term production.

show abstract

Section: Multiple Orders Acceptance Andmentioning

confidence: 99%

Multiple Precast Component Orders Acceptance and Scheduling

Jiang

Cao

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The OAS problem has received extensively research attention over the past two decades [1]. Although the OAS problems have been studied with various objective functions, current researches focus more on two objective functions, that is, (1) maximization the total profit as the sum of revenues minus the total weighted tardiness [2][3][4][5][6][7][8][9][10][11][12][13], (2) minimization of the makespan of the accepted orders plus the total penalties of all rejected orders [14][15][16]. As previously stated, this paper studies the OAS problem on unrelated parallel machines with the first objective.…”

Section: Introductionmentioning

confidence: 99%

“…As previously stated, this paper studies the OAS problem on unrelated parallel machines with the first objective. With this objective, many researches have been performed on different machine environments, including single machine [2][3][4][5][6][7][8], flow shop [9][10] and parallel machines [11][12][13]. In the unrelated parallel machines context, Wang and Ye [13] developed a formulation-based branch-and-bound algorithm with the idea of "divide and conquer".…”

Section: Introductionmentioning

confidence: 99%

Order acceptance and scheduling on unrelated parallel machines

Xie¹

2022

HBEM

View full text Add to dashboard Cite

This paper considers an order acceptance and scheduling problem on unrelated parallel machines. The objective is to select and schedule a subset of accepted orders that maximizes the total profit, which is defined as the sum of revenues of all the accepted orders minus their weighted tardiness penalties. We formulate the problem as a mixed-integer linear programming model. To solve this strongly NP-hard problem, we also propose a heuristic algorithm based on the Lagrangian relaxation technique and some greedy search operations.

show abstract