.png){kind=icon}
.png){kind=icon}
Return
Machine scheduling with soft precedence constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2019.09.041.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a new concept, soft precedence constraint (SPC), in machine scheduling problems. Similar to the conventional precedence constraint, SPC specifies some partial order over the jobs; however, an SPC can be violated, but with a certain penalty or cost. The scheduling problem is to balance the tradeoff between the SPC violation penalty and other criteria relative to job completion times. We focus on studying a special case where SPC is defined by a bipartite network. This case is motivated by the berth allocation problem at a transshipment port, where the SPC models any missed container connections from feeder vessels to ocean-going vessels. We discuss the complexity of the problems for different scenarios and develop approximation algorithms. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Scheduling
Precedence constraint
Soft precedence constraint
Approximation algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W