An improved precedence rule for single machine sequencing problems with quadratic penalty (Q1580988): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00207-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1980453217 / rank | |||
Normal rank |
Latest revision as of 11:58, 30 July 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