Multi-machine scheduling method for minimizing expected advance and tardiness expense
The invention discloses a multi-machine scheduling method for minimizing expected advance and tardiness expense, and belongs to the technical field of machine scheduling. The workpiece sequence and the delivery period are taken as decision variables, and the situation of multiple machines is conside...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The invention discloses a multi-machine scheduling method for minimizing expected advance and tardiness expense, and belongs to the technical field of machine scheduling. The workpiece sequence and the delivery period are taken as decision variables, and the situation of multiple machines is considered. For a single machine with a symmetrical cost structure and the same multi-machine problem, a minimum variance first (SVF) scheduling method is given, and a greedy algorithm is designed according to the rule. An equivalent second-order cone programming model is given for the problem of a generalcost structure; in order to realize more efficient solution, a heuristic scheduling method based on modal function characteristics is provided for two-machine problems, and a variable neighborhood method is provided for a multi-machine problem. According to the method provided by the invention, the uncertainty of the processing time is considered, so that the decision better conforms to the actual situation, the practica |
---|