Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time - Wang, Ji-Bo; Wang, Ming-Zheng (Computers & operations research, 2012)
Keywords: Algorithms; Applied sciences; Branch & bound algorithms; Computation; Convex resource allocation; Dominance; Exact sciences and technology; Heuristic; Heuristic methods; Job shops; Mathematical models; Operational research and scientific management; Operational research. Management science; Optimization; Optimization algorithms; Production scheduling; Resource allocation; Scheduling; Scheduling, sequencing; Single-machine; Studies; Convex resource allocation; Single-machine; Scheduling; Lower bound; Optimal algorithm; Branch and bound method; Resource allocation; Dominance; Processing time; Polynomial method; Computational complexity; Polynomial time; Production management; Optimal allocation; Resource constraint; Heuristic method; Open systems; Convex function; Resource management; Single machine; Completion time; Execution time