scientific article; zbMATH DE number 846900
From MaRDI portal
Publication:4864756
zbMath0873.90055MaRDI QIDQ4864756
Publication date: 25 February 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
project schedulingparallel machineroutingdeterministic schedulingjob shopsflow shopsopen shopstravelling salesmenChinese postmen
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (8)
Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ Improving fleet utilization for carriers by interval scheduling ⋮ Minimization of makespan in generalized assignment problem. ⋮ Scheduling identical parallel machines with tooling constraints ⋮ A family of inequalities valid for the robust single machine scheduling polyhedron ⋮ Throughput-optimal sequences for cyclically operated plants ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ A variant of time minimizing assignment problem
This page was built for publication:
