A scheduling problem with unrelated parallel machines and sequence dependent setups (Q973463): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1504/ijor.2007.014169 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104677896 / rank | |||
Normal rank | |||
Latest revision as of 09:56, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A scheduling problem with unrelated parallel machines and sequence dependent setups |
scientific article |
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
