scientific article; zbMATH DE number 942479
From MaRDI portal
Publication:4714493
zbMath0859.90086MaRDI QIDQ4714493
No author found.
Publication date: 25 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ Parallel-machine scheduling of simple linear deteriorating jobs ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Scheduling deteriorating jobs subject to job or machine availability constraints ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ A note on the complexity of flow-shop scheduling with deteriorating jobs ⋮ A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times ⋮ ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation ⋮ Isomorphic scheduling problems ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Scheduling deteriorating jobs with rejection on dominant machines ⋮ Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
This page was built for publication:
