DeepAI AI Chat
Log In Sign Up

An efficient polynomial-time approximation scheme for parallel multi-stage open shops

by   Jianming Dong, et al.
Georgia Southern University
NetEase, Inc

Various new scheduling problems have been arising from practical production processes and spawning new research areas in the scheduling field. We study the parallel multi-stage open shops problem, which generalizes the classic open shop scheduling and parallel machine scheduling problems. Given m identical k-stage open shops and a set of n jobs, we aim to process all jobs on these open shops with the minimum makespan, i.e., the completion time of the last job, under the constraint that job preemption is not allowed. We present an efficient polynomial-time approximation scheme (EPTAS) for the case when both m and k are constant. The main idea for our EPTAS is the combination of several categorization, scaling, and linear programming rounding techniques. Jobs and/or operations are first scaled and then categorized carefully into multiple types so that different types of jobs and/or operations are scheduled appropriately without increasing the makespan too much.


page 1

page 2

page 3

page 4


A PTAS for parallel two-stage flowshops under makespan constraint

As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple ...

Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints

We consider the classic problem of scheduling jobs with precedence const...

On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops

Motivated by the current research in data centers and cloud computing, w...

Open shop scheduling games

This paper takes a game theoretical approach to open shop scheduling pro...

Scheduling Coflows with Dependency Graph

Applications in data-parallel computing typically consist of multiple st...

Improved approximation schemes for early work scheduling on identical parallel machines with common due date

We study the early work scheduling problem on identical parallel machine...

A Rely-Guarantee Specification of Mixed-Criticality Scheduling

The application considered is mixed-criticality scheduling. The core for...