This article uses an integrated approach to solve real-world problems in three areas, namely single machine scheduling, 1-center location on networks and nonrenewable allocation problems. Jobs are stored at vertices and a single machine will be placed in the network. Each job receives an allocation that comes with a specific cost from an expected limited budget. Processing times of jobs are considered continuous functions of the allocation variables multiplied by costs, while release dates are defined as distances from job locations to the machine. We call this problem the scheduling-location problem with job allocation. The goal is to find a location on networks and an allocation to minimize a scheduling objective, makespan. We first consider the problem at a fixed location and propose a combinatorial algorithm that repeatedly solves continuous knapsack problems and runs in quadratic time. Concerning the original problem, we explore some properties of the objective function and develop a polynomial time algorithm to solve it.

本文采用综合方法解决三个领域的实际问题，即单机调度、网络上的单中心位置和不可更新分配问题。作业存储在顶点，并且网络中将放置一台机器。每项工作都会收到分配，该分配带有预期有限预算中的特定成本。作业的处理时间被认为是分配变量乘以成本的连续函数，而发布日期被定义为从作业位置到机器的距离。我们将此问题称为作业分配的调度位置问题。目标是在网络上找到一个位置并进行分配，以最小化调度目标、完工时间。我们首先考虑固定位置的问题，并提出一种重复解决连续背包问题并以二次时间运行的组合算法。关于原始问题，我们探索了目标函数的一些属性并开发了多项式时间算法来解决它。