Showing 1 - 10 of 73
In this paper, we consider a variant of the classical parallel machine scheduling problem. For this problem, we are given m potential identical machines to non-preemptively process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine...
Persistent link: https://www.econbiz.de/10005047159
Persistent link: https://www.econbiz.de/10011487982
Persistent link: https://www.econbiz.de/10014225734
Persistent link: https://www.econbiz.de/10014580776
Persistent link: https://www.econbiz.de/10014484002
Persistent link: https://www.econbiz.de/10014485260
We study a preemptive scheduling problem on two identical parallel machines that share a common server. Each job has to be loaded by the server before being processed on one of the machines and unloaded by the server after its processing. The loading and unloading times are both equal to one...
Persistent link: https://www.econbiz.de/10010940521
Purpose – The purpose of this paper is to examine how firm resources and diversification strategy explain the performance consequences of internationalization of emerging market enterprises. Design/methodology/approach – The paper conducts a regression analysis by using a novel panel data...
Persistent link: https://www.econbiz.de/10014936156
In this paper, we investigate the capacitated two-parallel machines scheduling problem, where one machine is only available for a special period of time after which it can no longer process any job while the other machine is continuously available. Our objective is to minimize the completion...
Persistent link: https://www.econbiz.de/10009642914
Given a network N(V, A, u, c) and a feasible flow x0, an inverse minimum cost flow problem is to modify the cost vector as little as possible to make x0 form a minimum cost flow of the network. The modification can be measured by different norms. In this paper, we consider the inverse minimum...
Persistent link: https://www.econbiz.de/10008865174