scientific article; zbMATH DE number 5052107

zbMATH Open1183.90165MaRDI QIDQ5486497FDOQ5486497

Gang Cheng, Xiwen Lu

Publication date: 11 September 2006

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

zbMATH Keywords

makespanNP-hardnessflow-shopbatch machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem 👍 👎
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms 👍 👎
• Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity 👍 👎
• A new three-machine shop scheduling: complexity and approximation algorithm 👍 👎
• A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime 👍 👎
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan 👍 👎
• Title not available (Why is that?) 👍 👎
• Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times 👍 👎
• Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times 👍 👎

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