Journal Article10.4028/WWW.SCIENTIFIC.NET/AMR.215.111
Preemptive Open-Shop Scheduling: Network Flow Based Algorithm
5
TL;DR: Based on the characteristics of the preemptive open-shop, the scheduling problem was formulated as a mixed-integer programming model with the objective to minimize the make-span and a network flow based algorithm was presented.
read more
Abstract: Preemptive open-shop scheduling problem was studied, and a network flow based algorithm was presented. Firstly, based on the characteristics of the preemptive open-shop, the scheduling problem was formulated as a mixed-integer programming model with the objective to minimize the make-span. The maximum flow model of the preemptive open-shop was developed to model the machine resource allocation and time constraints. Moreover a new preflow push algorithm for the maximum flow model was put forward. Based on the solution of machine resource allocation problem got by preflow push algorithm, the sequences of the tasks processed by each machine were determined by calculating the matrix of the processing times and decrementing set. Finally, the validity of the developed scheduling algorithm is illustrated by randomly generated example.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Four decades of research on the open-shop scheduling problem to minimize the makespan
TL;DR: In this article, the authors present an up-to-date and comprehensive review of studies on the open shop scheduling problem that focuses on minimizing the makespan, and discuss potential research opportunities.
70
An improved branch-and-bound algorithm for the preemptive open shop total completion time scheduling problem
TL;DR: In this paper, a branch-and-bound algorithm is proposed to solve the problem of scheduling preemptive open shops to minimize the total completion time, which is known to be NP-hard.
7
A fast heuristic to minimize number of tardy jobs in preemptive open shops
TL;DR: In this article, the problem of scheduling preemptive open shops to minimize the number of tardy jobs is considered. And a mixed integer program is presented for solving small-sized problems and an efficient heuristic is constructed for solving large-size problems.
2
A Heuristic Algorithm Based on Temporal Conflict Network for Agile Earth Observing Satellite Scheduling Problem
TL;DR: This paper proposes a temporal conflict network-based heuristic algorithm (TBHA), for AEOSSP, and shows that the TBHA algorithm performs very well in terms of both solution quality and computational efficiency.
Multi-objective optimization research on the makespan with preemptions for parallel machine problem
Gong-zhen WANG,Yi-ping LU +1 more
TL;DR: This study proposes a multi-objective mixed-integer programming model to minimize makespan with preemptions for parallel machine problems, improving upon existing algorithms LRPT and LRPT-FM by reducing work interruption numbers.
References
A (2 + ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
TL;DR: The main result is a (2 + e)- approximation algorithm for this problem that is a generalized version of the classical preemptive open shop problem with sum of weighted job completion times objective.
35
Heuristics for scheduling in a no-wait open shop with movable dedicated machines
TL;DR: Computational results show that the heuristic is fairly effective in finding an optimal or a near-optimal solution for small-sized problems, and results of theheuristic for experiments tallied with the real-life environment demonstrate the potential of theHeuristic to efficiently deal with the scheduling problems.
29
Heuristics for scheduling in a no-wait open shop with movable dedicated machines
Hung-Tso Lin,Hong-Tau Lee,Wen-Jung Pan +2 more
- 01 Feb 2008
25
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem
TL;DR: A tabu search (TS) approach is adopted together with the optimal timing algorithm to generate job completion sequences and final schedules to minimize total tardiness in two-machine preemptive open shops.
Two-machine open shop scheduling with an availability constraint
TL;DR: A two-machine open shop scheduling problem, in which one machine is not available for processing during a given time interval, is studied and an approximation algorithm with a worst-case ratio of 43.5 is presented.