KI 2005: Advances in Artificial Intelligence

DOI10.1007/11551263zbMath1137.90482OpenAlexW2503248537MaRDI QIDQ5897750

Jacek Błażewicz, Frank Werner, Erwin Pesch, Małgorzata Sterna

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11551263

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management ⋮ Variable neighbourhood search: methods and applications ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Variable neighbourhood search: Methods and applications ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work

This page was built for publication: KI 2005: Advances in Artificial Intelligence