This article is cited in 2 papers

Effective algorithms for one scheduling problem on two machines with makespan minimization

A. A. Romanova<sup>ab

a</sup> Omsk Law Academy, 12 Korolenko St., 644010 Omsk, Russia
^b Omsk State University, 55-a Mir Ave., 644077 Omsk, Russia

Abstract: We consider an NP-hard problem of scheduling a set of jobs of equal processing time on two machines, given a partial precedence order between the jobs, with an objective to minimize the makespan. An approximation algorithm with performance guarantee is proposed for this problem. Polynomial solvability of the problem is proved in the case when each job on the first machine is in precedence relation with two jobs on the second machine. Ill. 9, bibliogr. 8.

Keywords: cross-docking problem, schedule, partial order, approximation algorithm.

UDC: 519.2+621.391

Received: 17.03.2015
Revised: 06.05.2015

DOI: 10.17377/daio.2015.22.483

 English version: Journal of Applied and Industrial Mathematics, 2015, 9:4, 570–579

Bibliographic databases:

• 
•