A modified shifting bottleneck procedure for job-shop scheduling (Q4696979): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The one-machine sequencing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A modified shifting bottleneck procedure for job-shop scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times / rank | |||
Normal rank | |||
Latest revision as of 17:52, 17 May 2024
scientific article; zbMATH DE number 221496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified shifting bottleneck procedure for job-shop scheduling |
scientific article; zbMATH DE number 221496 |
Statements
A modified shifting bottleneck procedure for job-shop scheduling (English)
0 references
29 June 1993
0 references
shifting bottleneck procedure
0 references
job-shop scheduling
0 references
