Showing 1 - 10 of 2,713
Persistent link: https://www.econbiz.de/10000107230
Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the job completion times. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that strong...
Persistent link: https://www.econbiz.de/10005065288
Wireless sensor networks involve many different real-world contexts, such as monitoring and control tasks for traffic, surveillance, military and environmental applications, among others. Usually, these applications consider the use of a large number of low-cost sensing devices to monitor the...
Persistent link: https://www.econbiz.de/10010597700
In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) with setup times is considered. DLSP is the problem of determining the sequence and size of production batches for multiple items on a single machine. The objective is to find a minimal cost production schedule such that dynamic...
Persistent link: https://www.econbiz.de/10009203826
Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a well-known problem that consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the...
Persistent link: https://www.econbiz.de/10010731769
We consider a real world generalization of the 2-Dimensional Guillotine Cutting Stock Problem arising in the wooden board cutting industry. A set of rectangular items has to be cut from rectangular stock boards, available in multiple formats. In addition to the classical objective of trim loss...
Persistent link: https://www.econbiz.de/10011051801
heuristics fail to identify an improving column, an exhaustive search is performed starting with incrementally larger ending …
Persistent link: https://www.econbiz.de/10010950401
This paper addresses two versions of a lifetime maximization problem for target coverage with wireless directional sensor networks. The sensors used in these networks have a maximum sensing range and a limited sensing angle. In the first problem version, predefined sensing directions are assumed...
Persistent link: https://www.econbiz.de/10010682502
Persistent link: https://www.econbiz.de/10008552384
Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a well-known problem that consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the...
Persistent link: https://www.econbiz.de/10005450847