An improved precedence rule for single machine sequencing problems with quadratic penalty (Q1580988): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4859582 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:01, 30 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved precedence rule for single machine sequencing problems with quadratic penalty |
scientific article |
Statements
An improved precedence rule for single machine sequencing problems with quadratic penalty (English)
0 references
21 January 2001
0 references
scheduling theory
0 references
sequencing
0 references
single machine
0 references
quadratic penalty
0 references
heuristic
0 references
