A scheduling problem with unrelated parallel machines and sequence dependent setups (Q973463)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A scheduling problem with unrelated parallel machines and sequence dependent setups |
scientific article; zbMATH DE number 5714908
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A scheduling problem with unrelated parallel machines and sequence dependent setups |
scientific article; zbMATH DE number 5714908 |
Statements
A scheduling problem with unrelated parallel machines and sequence dependent setups (English)
0 references
1 June 2010
0 references
Summary: This paper addresses a scheduling problem with unrelated parallel machines, sequence dependent setups and due dates. The problem is based on a real case and the objective is to minimise the sum of the makespan and the weighted delays. A mixed integer linear programming model is proposed and since the model considers realistic constraints, a metaheuristic based on GRASP is used as a solution method. Several versions of the metaheuristic are tested and multiple instances of the problem with different configurations are generated to test the solution quality and the computational performance.
0 references
scheduling
0 references
\texttt{GRASP}
0 references
metaheuristics
0 references
0 references
0.94845545
0 references
0.9393357
0 references
0.9284735
0 references
0 references
0.91752267
0 references
0 references
0.91440856
0 references
