English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Makespan minimization in job shops: a polynomial time approximation scheme

Solis-Oba, R., Jansen, K., & Sviridenko, M. (1999). Makespan minimization in job shops: a polynomial time approximation scheme. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99) (pp. 394-399). New York, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35D9-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35DA-4
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Solis-Oba, Roberto1, Author           
Jansen, Klaus1, Author           
Sviridenko, Maxim, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: In this paper we present a polynomial time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operationsper job. The polynomial time approximation scheme can be extended to the case of job shop problems with release and delivery times, multiprocessor job shops, and dag job shops.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021999
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518022
Other: Local-ID: C1256428004B93B8-EDEC3A84C78D7055C125676F004F9B3F-Solis-Oba1999a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Atlanta, USA
Start-/End Date: 1999

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 394 - 399 Identifier: ISBN: 1-58113-067-8