AN EFFICIENT ALGORITHM FOR A JOB-SHOP PROBLEM

doi:10.1007/BF02099698

1995-12-01

PRE

Wiesław Kubiak

Suresh Sethi

Chelliah Sriskandarajah

DOI：10.1007/BF02099698

原文链接

原文求助

摘要

En 中文

We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [1,2], Hefetz and Adiri [7], and Timkovskiy [15]. The idea behind the algorithm has the potential of extension to job shops with parallel machines.

Keyword:

COMPLEXITY

AI总结

对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Annals of Operations Research

IF:

4.5

论文数:

8.1K

被引数:

2.1W

机构

暂无机构信息

引用论文

Review of Avoidant/Restrictive Food Intake Disorder

Psychiatric Annals

IF0

2018-10-01

PREAI

Diana Ushay; Phillip J. Seibell

The Expression of Adipophilin Is Frequently Found in Solid Subtype Adenocarcinoma and Is Associated with Adverse Outcomes in Lung Adenocarcinoma

Journal of Pathology and Translational Medicine

IF0

2018-11-15

OAAI

Sun Ah Shin; Hee Young Na; Ji Young Choe; Doohyun Chung; Mira Park; Sohee Oh; Ji Eun Kim

A PSEUDO-POLYNOMIAL ALGORITHM FOR A 2-MACHINE NO-WAIT JOB-SHOP SCHEDULING PROBLEM

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

IF6

1989-12-01

PREAI

KUBIAK, W

Scheduling unit-time tasks with integer release times and deadlines

Information Processing Letters

IF0

1983-05-01

PREAI

Greg N. Frederickson

Skeletal Muscle

IF0

2023-07-12

OAAI

Tea Shavlakadze; Kun Xiong; Shawn Mishra; Corissa McEwen; Abhilash Gadi; Matthew Wakai; Hunter Salmon; Michael J. Stec; Nicole Negron; Min Ni; Yi Wei; Gurinder S. Atwal; Yu Bai; David J. Glass

Pediatric Research

IF0

1984-09-01