Showing 1 - 10 of 99
We consider the online Steiner Traveling Salesman Problem. In this problem, we are given an edge-weighted graph G = (V, E) and a subset D⊆V of destination vertices, with the optimization goal to find a minimum weight closed tour that traverses every destination vertex of D at least once....
Persistent link: https://www.econbiz.de/10011190815
This paper is concerned with the Online Quota Traveling Salesman Problem. Depending on the symmetry of the metric and the requirement for the salesman to return to the origin, four variants are analyzed. We present optimal deterministic algorithms for each variant defined on a general space, a...
Persistent link: https://www.econbiz.de/10010785317
This paper studies preemptive bi-criteria scheduling on m parallel machines with machine unavailable intervals. The …
Persistent link: https://www.econbiz.de/10011209321
In this paper, we conduct a study of the job-shop scheduling problem with reverse flows. This NP-hard problem is …
Persistent link: https://www.econbiz.de/10011209333
parallel machines where jobs can only be delivered at certain fixed delivery dates. Scheduling problems with fixed delivery …
Persistent link: https://www.econbiz.de/10011209377
This paper presents a novel approach for solving an integrated production planning and scheduling problem. In theory as …. Scheduling largely depends on the production quantities (lot sizes) computed at the production planning level and ignoring … scheduling constraints in planning leads to inconsistent decisions. Integrating production planning and scheduling is therefore …
Persistent link: https://www.econbiz.de/10011209402
Systems of systems are collections of independent systems which interact and share information to provide services. To communicate, systems can opportunistically make use of contacts that occur when two entities are close enough to each other. In this paper, it is assumed that reliable...
Persistent link: https://www.econbiz.de/10011209408
A network needs to be constructed by a server (construction crew) that has a constant construction speed which is incomparably slower than the server’s travel speed within the already constructed part of the network. A vertex is recovered when it becomes connected to the depot by an already...
Persistent link: https://www.econbiz.de/10011264292
The flexible job shop scheduling is a challenging problem due to its high complexity and the huge number of …
Persistent link: https://www.econbiz.de/10011264307
Strong uncertainties is a key challenge for the application of scheduling algorithms in real-world production … a large majority of unexpected events. This paper studies the uncertain scheduling problem arising from the steelmaking … approach, traditional scheduling decisions, i.e. the beginning time and assigned machine for each job at each stage, are …
Persistent link: https://www.econbiz.de/10011264332