scientific article

zbMATH Open0657.90053MaRDI QIDQ3806976

Eugeniusz Nowicki

Publication date: 1986

Title of this publication is not available (Why is that?)

zbMATH Keywords

heuristicpolynomial algorithmsNP-completetwo-machine flow-shopmaximum job completion timejob processing times

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Title not available (Why is that?) ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs 👍 👎
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times 👍 👎
• Two-machine flowshop scheduling to minimize mean flow time 👍 👎
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases 👍 👎
• Minimizing the total flow time and the tardiness in a two-machine flow shop 👍 👎
• Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times 👍 👎
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops 👍 👎
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases 👍 👎
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds 👍 👎

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 Q3806976)