Minimizing task completion time with the execution set method

DOI10.1016/J.EJOR.2006.09.030zbMATH Open1146.90348OpenAlexW2037811257MaRDI QIDQ2467305FDOQ2467305

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)

Cites Work

• Title not available (Why is that?)
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Critical-Path Planning and Scheduling: Mathematical Basis
• Title not available (Why is that?)
• Application of a Technique for Research and Development Program Evaluation
• Critical path in an activity network with time constraints
• Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Finding the critical path in an activity network with time-switch constraints

Cited In (1)

• Title not available (Why is that?)

   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 👍 👎

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)