Polynomial-time approximation schemes for scheduling problems with time lags (Q600835): Difference between revisions

@@ Property / DOI @@
-.1007/s10951-009-0134-8
@@ Property / DOI: 10.1007/s10951-009-0134-8 / rank @@
-Normal rank
@@ Property / author @@
+Steef L. van de Velde
@@ Property / author: Steef L. van de Velde / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-009-0134-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1966192374
@@ Property / OpenAlex ID: W1966192374 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling the Open Shop to Minimize Mean Flow Time
+Normal rank
@@ Property / cites work @@
+A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
+Normal rank
@@ Property / cites work @@
+Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
+Normal rank
@@ Property / cites work @@
+Complexity results for flow-shop and open-shop scheduling problems with transportation delays
+Normal rank
@@ Property / cites work @@
+Deterministic Scheduling with Pipelined Processors
+Normal rank
@@ Property / cites work @@
+Shop Problems With Two Machines and Time Lags
@@ Property / cites work: Shop Problems With Two Machines and Time Lags / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
+Normal rank
@@ Property / cites work @@
+Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags
+Normal rank
@@ Property / cites work @@
+Heuristics for a coupled-operation scheduling problem
+Normal rank
@@ Property / cites work @@
+Open shop scheduling with delays
@@ Property / cites work: Open shop scheduling with delays / rank @@
+Normal rank
@@ Property / cites work @@
+Two-machine open shop scheduling with special transportation times
+Normal rank
@@ Property / cites work @@
+A heuristic for the two-machine open-shop scheduling problem with transportation times
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
+Normal rank
@@ Property / cites work @@
+Q4884350
@@ Property / cites work: Q4884350 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
+Normal rank
@@ Property / DOI @@
+.1007/S10951-009-0134-8
@@ Property / DOI: 10.1007/S10951-009-0134-8 / rank @@
+Normal rank