Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114193088, #quickstatements; #temporary_batch_1711565664090
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Open-shop scheduling problems with dominated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four decades of research on the open-shop scheduling problem to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Two-Machine Flowshop Problems on Networks with Special Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The routing open-shop problem on a network: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Linear Dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine open shop scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-preemptive two-machine open shop scheduling with non-availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for flow-shop and open-shop scheduling problems with transportation delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpreemptive open shop with restricted processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of small open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Three-Machine Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-shop dense schedules: properties and worst-case performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense open-shop schedules with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for two-machine flow shop scheduling with batch setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of heuristics for open shops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of two-machine open shops where jobs arrive over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4883371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good is a dense shop schedule? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for parallel open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine open shop problem with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation algorithms for the routing open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-Machine Routing Open Shop on a Triangular Transportation Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: How the difference in travel times affects the optima localization for the routing open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problem with an outsourcing option / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-phase method for preemptive scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Cylindrical Chromatic Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop, satellite communication and a theorem by Egerváry (1931) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-machine open shop with a bottleneck machine revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for short route job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for two-machine re-entrant shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the three-machine open shop with a bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the two-stage job shop scheduling problem with a bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage open shop scheduling with a bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine shop scheduling: Compromise between flexibility and makespan value / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Open-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine No-Wait Flow Shop Scheduling with Missing Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Open Shop Preemptive Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three is easy, two is hard: Open shop sum-batch scheduling problem refined / rank
 
Normal rank
Property / cites work
 
Property / cites work: Value of the Steinitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling three-operation jobs in a two-machine flow shop to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two machine mixed shop scheduling problem with controllable machine speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of the makespan in a two-machine problem under given resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for job shop scheduling problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine Open Shops with Renewable Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine shop scheduling problems with batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the routing open shop problem with two machines on a two-vertex network / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(log m)-approximation for the routing open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard cases in scheduling deteriorating jobs on dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete 4-parametric complexity classification of short shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: When difference in machine loads leads to efficient scheduling in open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time approximation scheme for makespan minimization in an open shop with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-machine proportionate open shop and mixed shop minimum makespan problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shops with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for flow shop scheduling problems with machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop no-wait scheduling with machine maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Machine Maintenance in Two-Machine Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with maximal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop and open shop scheduling with a critical machine and two operations per job / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum Lateness in a Two-Machine Open Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling open shops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with transportation considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: V-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling ordered open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the three-machine proportionate mixed shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transporting jobs through a two‐machine open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling incompatible tasks on two machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing to Minimize the Maximum Job Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop and open shop scheduling problems with a single maintenance window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on ''Flow shop and open shop scheduling with a critical machine and two operations per job'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation algorithms for proportionate open‐shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for scheduling a two-machine flowshop with one unavailability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flow shop scheduling problem with controllable job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine no-wait general and proportionate open shop makespan problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of the ordered and proportionate flow shop scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a linear programming heuristic for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of scheduling: a survey of milestones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling batches with simultaneous job processing for two-machine shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The open shop problem with routing at a two-node network and allowed preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine open shop scheduling with special transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Shops with No Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the multiprocessor open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seven problems: so different yet close / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonstrict vector summation in multi-operation scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252045 / 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: Linear time approximation scheme for the multiprocessor open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3965901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time open-shop problem with an arbitrary number of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some geometric methods in scheduling theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some positive news on the proportionate open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow-shop scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The open shop scheduling problem with a given sequence of jobs on one machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclical search for the two machine flow shop and open shop to minimise finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of shop-scheduling problems with three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of flow shop scheduling problems with transportation constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop-sequencing problem with synchronous transfers and makespan minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal choice of machine speeds for two-stage non-homogeneous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3980709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine Super-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two machine open shop scheduling problem with setup, processing and removal times separated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop scheduling problems under precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy open shop heuristic with job priorities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the two-machine open-shop scheduling problem with transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group technology approach to the open shop scheduling problem with batch setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-machine shop scheduling with partially ordered processing routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An open shop scheduling problem with a non-bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time-changing effects and rate-modifying activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal job-shop scheduling with two jobs in systems with unrestricted paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2 algorithm for two-machine open shop with route-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-permutation solutions to some two machine flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing n jobs on two machines with setup, processing and removal times separated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual criteria preemptive open-shop problems with minimum makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine open shop problem: To fit or not to fit, that is the question / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>n</i> log <i>n</i>) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for flow shop problems with synchronous movement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Makespan in a Class of Reentrant Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment problem with nearly Monge arrays and incompatible partner indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing open shop and flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line two-machine open shop scheduling with time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the parallel flow shop problem / rank
 
Normal rank

Revision as of 09:53, 29 July 2024

scientific article
Language Label Description Also known as
English
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
scientific article

    Statements

    Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (English)
    0 references
    22 June 2022
    0 references
    open shop scheduling
    0 references
    flow shop scheduling
    0 references
    complexity
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers