Minimizing task completion time with the execution set method

DOI10.1016/J.EJOR.2006.09.030MaRDI QIDQ2467305zbMATH OpenOpenAlexFDO

Authors Zohar Laslo, Baruch Keren, Hagai Ilani

Publication date 21 January 2008

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.09.030

zbMATH Keywords

linear programming optimizationnetworks/graphs: applications

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Recommendations

• Assembly-line scheduling with concurrent operations and parallel machines
• Concurrent operations assignment and sequencing for particular assembly problems in flow lines
• Minimizing completion time for a class of scheduling problems
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• A note on minimum makespan assembly plans

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Application of a technique for research and development program evaluation
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Critical path in an activity network with time constraints
• Critical-Path Planning and Scheduling: Mathematical Basis
• Finding the critical path in an activity network with time-switch constraints
• Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept

Cited in

(1)

• scientific article; zbMATH DE number 1974090 (Why is no real title available?)

This page was built for publication: Minimizing task completion time with the execution set method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467305)