scientific article; zbMATH DE number 2044495
From MaRDI portal
Publication:4448359
zbMATH Open1042.90020MaRDI QIDQ4448359FDOQ4448359
Authors: Juraj Hromkovič, K. Steinhöfel, Peter Widmayer 
Publication date: 18 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2202/22020090.htm
Title of this publication is not available (Why is that?)
Recommendations
- Job shop scheduling with unit length tasks: bounds and algorithms
- Job shop scheduling with unit length tasks
- Job Shop Scheduling with Unit Processing Times
- Job shop scheduling with unit processing times
- Job shop scheduling with unit time operations under resource constraints and release dates
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Scheduling unit-length jobs with machine eligibility restrictions
- Scheduling unit processing time jobs on an m-machine flow-shop
- scientific article; zbMATH DE number 5669900
- Better approximation guarantees for job-shop scheduling
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cited In (8)
- Advice complexity of fine-grained job shop scheduling
- Job Shop Scheduling with Unit Processing Times
- Job shop scheduling with unit length tasks: bounds and algorithms
- On the power of randomization for job shop scheduling withk-units length tasks
- Firefly-Inspired Algorithm for Job Shop Scheduling
- Job shop scheduling with unit length tasks
- Job shop scheduling with unit processing times
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448359)
