On the relocation problem with a second working crew for resource recycling

Abstract

In this paper, we introduce a variant of the relocation problem, which was formulated from a public house redevelopment project in Boston. In the problem of interest, given some initial resources in a common pool there is a set of jobs to be processed on a two-machine flowshop. Each job acquires a specific number of resources to start its processing and will return a number of resources to the pool at its completion. The resource consumption and resource recycle processes are performed on machine one and machine two, respectively, in a twomachine flowshop style. Abiding by the resource constraints, the problem seeks to find a feasible schedule whose makespan is minimized. In this paper, we first present NP-hardness proofs for some special cases. Three heuristic algorithms are designed to compose approximate schedules. Two lower bounds are developed and then used to test the performance of our proposed heuristics. Numerical results from computational experiments suggest that the proposed heuristics can produce quality solutions in a reasonable time.

Heuristics for scheduling data gathering with limited base station memory

“…The existence of optimal permutation schedules for this problem was analyzed by Fung and Zinder (2016). Lin and Huang (2006) analyzed a relocation problem with a second working crew for resource recycling. In their work, each job was executed on two machines in a permutation flow shop style.…”

“…Local search algorithms based on swaps were used for solving problem F2|r p|C max by Lin and Huang (2006), and they were shown to deliver good solutions. However, using a different neighborhood in a local search algorithm may result in obtaining even better results.…”

“…Reflecting the method used for generating the initial schedule, these algorithms are called IncShift, AlterShift, LFShift and RndShift. Lin and Huang (2006) proposed three heuristics H 1 , H 2 , H 3 for solving F2|r p|C max . However, for the special case of this problem analyzed in our work, both H 1 and H 2 yield the same results as IncSwap, and H 3 is equivalent to RndSwap.…”

“…Computational complexityIn this section, we show that although our problem is a simpler special case of the problems analyzed byLin and Huang (2006) andLin et al (2009), it remains strongly NP-hard. To this end, we use a reduction from the following strongly NP-complete Bin-Packing problem(Garey and Johnson 1979).…”

Relocation Scheduling in a Two-Machine Flow Shop with Resource Recycling Operations

“…Lin and Huang [12] first introduced the recycling operations for yielding the resource into the study on the relocation problem. In previous studies on the relocation problem, the resource is consumed when a job starts to process and returns immediately when it is completed.…”