Open Shop Scheduling to Minimize Finish Time

Authors:
Teofilo Gonzalez;Sartaj Sahni
Affiliations:
Computer Science Department, The Pennsylvania State University, University Park, PA;Department of Computer Science, 114 Lind Hall, University of Minnesota, Minneapolis, MN
Venue:
Journal of the ACM (JACM)
Year:
1976

Citing 1
Cited 90

Graphs and Hypergraphs

Graphs and Hypergraphs

Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies

IEEE/ACM Transactions on Networking (TON)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Preemptive Scheduling with Release Times, Deadlines, and Due Times

Journal of the ACM (JACM)
Performance of dispatching rules under perfect sequencing flexibility

WSC' 90 Proceedings of the 22nd conference on Winter simulation
A parallel multi-operation scheduling problem with machine order constraints

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Test scheduling for core-based systems

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
A unified algorithmic framework for variable-rate TDM switching assignments

IEEE/ACM Transactions on Networking (TON)
Block-cyclic redistribution over heterogeneous networks

Cluster Computing
A 3 /2 Algorithm for Two-Machine Open Shopwith Route-Dependent Processing Times

Journal of Heuristics
Local search with constraint propagation and conflict-based heuristics

Artificial Intelligence
The total completion time open shop scheduling problem with a given sequence of jobs on one machine

Computers and Operations Research
On the complexity of non-preemptive shop scheduling with two jobs

Computing
Bounded fan-out multimessage multicasting

Nordic Journal of Computing
Genetic Algorithms for Solving Open Shop Scheduling Problems

EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Metaheuristics for Group Shop Scheduling

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Task Distributions on Multiprocessor Systems

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Computer-Aided Way to Prove Theorems in Scheduling

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A (2 + ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective

Journal of Algorithms
Algorithms for edge coloring bipartite graphs

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Probabilistic Analysis of Cyclic Packet Transmission Scheduling in WDM Optical Networks

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem

Computers and Operations Research
Guaranteed scheduling for switches with configuration overhead

IEEE/ACM Transactions on Networking (TON)
Scheduling problems for parallel dedicated machines under multiple resource constraints

Discrete Applied Mathematics - International symposium on combinatorial optimisation
Open shop scheduling problems with late work criteria

Discrete Applied Mathematics
SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT

Probability in the Engineering and Informational Sciences
Scheduling two-machine preemptive open shops to minimize total completion time

Computers and Operations Research
A Note on System-on-Chip Test Scheduling Formulation

Journal of Electronic Testing: Theory and Applications
Scheduling and lot streaming in flowshops with no-wait in process

Journal of Scheduling
Scheduling satellite-switched time-division multiple access with general switching modes

IEEE/ACM Transactions on Networking (TON)
Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Exchanging messages of different sizes

Journal of Parallel and Distributed Computing
Open block scheduling in optical communication networks

Theoretical Computer Science - Approximation and online algorithms
An adaptive contention-based scheduling scheme for proportional service differentiation in multichannel wireless networks

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Scheduling two-machine no-wait open shops to minimize makespan

Computers and Operations Research
Scheduling Messages For Data Redistribution: An Experimental Study

International Journal of High Performance Computing Applications
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications

Journal of Scheduling
A new particle swarm optimization for the open shop scheduling problem

Computers and Operations Research
A genetic algorithm for machine scheduling problem under shared resource constraints

International Journal of Computer Applications in Technology
Optimization of logical rings for multi-hop transmissions in WDM optical star networks

Computer Communications
Minimizing the stretch when scheduling flows of divisible requests

Journal of Scheduling
Single-hop all-to-all broadcast in optical star networks with breakdown or power-off transceivers

International Journal of Communication Networks and Distributed Systems
Dense open-shop schedules with release times

Theoretical Computer Science
A genetic algorithm for the proportionate multiprocessor open shop

Computers and Operations Research
SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM

Cybernetics and Systems
Scheduling Problems in Cross Docking

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Integrality Property in Preemptive Parallel Machine Scheduling

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Complete Complexity Classification of Short Shop Scheduling

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A parallel genetic algorithm for the open-shop scheduling problem using deterministic and random moves

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
The mixed shop scheduling problem

Discrete Applied Mathematics
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Scheduling school meetings

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Polynomial-time approximation schemes for scheduling problems with time lags

Journal of Scheduling
Scheduling algorithms

Algorithms and theory of computation handbook
On the design of optimal TDM schedules for broadcast WDM networks with arbitrary transceiver tuning latencies

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems

Expert Systems with Applications: An International Journal
Properties of optimal schedules in preemptive shop scheduling

Discrete Applied Mathematics
Unbounded parallel-batch scheduling with family jobs and delivery coordination

Information Processing Letters
A hybrid discrete particle swarm algorithm for open-shop problems

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates

Applied Soft Computing
Open-shop dense schedules: properties and worst-case performance ratio

Journal of Scheduling
The routing open shop problem: new approximation algorithms

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

Mathematical and Computer Modelling: An International Journal
An Optimal Constraint Programming Approach to the Open-Shop Problem

INFORMS Journal on Computing
Two-machine shop scheduling problems with batch processing

Mathematical and Computer Modelling: An International Journal
Three is easy, two is hard: open shop sum-batch scheduling problem refined

Operations Research Letters
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

Operations Research Letters
Two-machine open shop problem with controllable processing times

Discrete Optimization
A preemptive open shop scheduling problem with one resource

Operations Research Letters
Scheduling open shops with parallel machines

Operations Research Letters
Scheduling shops to minimize the weighted number of late jobs

Operations Research Letters
On the optimality of static policy in stochastic open shop

Operations Research Letters
Scheduling unit time open shops to minimize the weighted number of late jobs

Operations Research Letters
Open shop, satellite communication and a theorem by Egerváry (1931)

Operations Research Letters
Approximation algorithms for the multiprocessor open shop scheduling problem

Operations Research Letters
Lot streaming in open shops

Operations Research Letters
Group technology approach to the open shop scheduling problem with batch setup times

Operations Research Letters
An open shop scheduling problem with a non-bottleneck machine

Operations Research Letters
The two-machine open shop problem: To fit or not to fit, that is the question

Operations Research Letters
Two-machine open shop scheduling with an availability constraint

Operations Research Letters
An improved approximation algorithm for the partial Latin square extension problem

Operations Research Letters
On the complexity of preemptive open-shop scheduling problems

Operations Research Letters
A linear time approximation scheme for makespan minimization in an open shop with release dates

Operations Research Letters
A Complete 4-parametric complexity classification of short shop scheduling problems

Journal of Scheduling
Efficient approximation algorithms for the routing open shop problem

Computers and Operations Research
Approximation algorithms for parallel open shop scheduling

Information Processing Letters
A survey on offline scheduling with rejection

Journal of Scheduling
A new three-machine shop scheduling: complexity and approximation algorithm

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

A linear time algorithm to obtain a minimum finish time schedule for the two-processor open shop together with a polynomial time algorithm to obtain a minimum finish time preemptive schedule for open shops with more than two processors are obtained. It is also shown that the problem of obtaining minimum finish time nonpreemptive schedules when the open shop has more than two processors is NP-complete.