Makespan minimization in preemptive two machine job shops (Q1377264): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Preemptive job-shop scheduling problems with a fixed number of jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4231913 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Makespan minimization in open shops: A polynomial time approximation scheme / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank | |||
Normal rank |
Latest revision as of 10:36, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Makespan minimization in preemptive two machine job shops |
scientific article |
Statements
Makespan minimization in preemptive two machine job shops (English)
0 references
2 June 1998
0 references
scheduling
0 references
job shop
0 references
0 references