Related Experiment Video
Updated: Sep 7, 2025

Operation of the Collaborative Composite Manufacturing CCM System
Published on: October 1, 2019
Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
1College of Computer Science and Technology, Shandong Technology and Business University, Yantai 264005, China.
Abstract:
This paper studies the Pareto scheduling problem of minimizing total weighted completion time and maximum cost on a single machine. It is known that the problem is strongly NP-hard. Algorithms with running time $ O(n^3) $ are presented for the following cases: arbitrary processing times, equal release dates and equal weights; equal processing times, arbitrary release dates and equal weights; equal processing times, equal release dates and arbitrary weights.
Related Concept Videos
Machines: Problem Solving I
The toggle clamp system is a machine structure consisting of movable, pin-connected multi-force members that form a stabilized system to transmit forces. The...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Machines: Problem Solving II
Distributed Loads: Problem Solving
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Statically Indeterminate Problem Solving

