A particular timetable problem: terminal scheduling (Q3766555): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331938708843221 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007559758 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simple scheduling algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A classroom/time assignment model / rank | |||
Normal rank | |||
Latest revision as of 13:06, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A particular timetable problem: terminal scheduling |
scientific article |
Statements
A particular timetable problem: terminal scheduling (English)
0 references
1987
0 references
Hungarian method
0 references
shortest path
0 references
optimal time table
0 references
alternating paths
0 references
minimal path algorithm
0 references
heuristic algorithm
0 references
