Similar Search Results

A game mechanism for single machine sequencing with zero risk

Kovalyov, Mikhail Y.; Pesch, Erwin - In: Omega 44 (2014) C, pp. 104-110

A problem is studied in which several non-cooperating clients compete for earlier execution of their jobs in a processing sequence of a single service provider in order to minimize job completion time costs. The clients can move their jobs earlier in a given sequence. They are assumed not to...

Persistent link: https://www.econbiz.de/10010738085

The falling tide algorithm: A new multi-objective approach for complex workforce scheduling

Li, Jingpeng; Burke, Edmund K.; Curtois, Tim; Petrovic, … - In: Omega 40 (2012) 3, pp. 283-293

employee scheduling problem, i.e. nurse rostering with many hard and soft constraints. By employing a goal programming model …

Persistent link: https://www.econbiz.de/10010870970

Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends

Yenisey, Mehmet Mutlu; Yagmahan, Betul - In: Omega 45 (2014) C, pp. 119-135

The flow shop scheduling problem is finding a sequence given n jobs with same order at m machines according to certain … most common objective for this problem is makespan. However, many real-world scheduling problems are multi-objective by … nature. Over the years there have been several approaches used to deal with the multi-objective flow shop scheduling problems …

Persistent link: https://www.econbiz.de/10010744170

A combined robot selection and scheduling problem for flow-shops with no-wait restrictions

Shabtay, Dvir; Arviv, Kfir; Stern, Helman; Edan, Yael - In: Omega 43 (2014) C, pp. 96-107

This paper addresses a bicriteria no-wait flow-shop scheduling problem with multiple robots transferring jobs between … machines and that machine idle times are not allowed. We define a combined robot selection and scheduling problem (RSSP) for a … (iii) scheduling the robot moves. We define a robot schedule as feasible if all the jobs satisfy the no-wait condition and …

Persistent link: https://www.econbiz.de/10010719545

Planning a sustainable reverse logistics system: Balancing costs with environmental and social concerns

Ramos, Tânia Rodrigues Pereira; Gomes, Maria Isabel; … - In: Omega 48 (2014) C, pp. 60-74

operational decisions are studied involving the establishment of service areas for each depot and the definition and scheduling of …

Persistent link: https://www.econbiz.de/10011051810

Scheduling to minimize stringer utilization for continuous annealing operations

Mujawar, Sachin; Huang, Simin; Nagi, Rakesh - In: Omega 40 (2012) 4, pp. 437-444

stringer, which is very expensive to a mill. This paper deals with modeling the sequencing/scheduling problem of coils on …

Persistent link: https://www.econbiz.de/10011051861

Single machine total completion time scheduling problem with workload-dependent maintenance duration

Xu, Dehua; Wan, Long; Liu, Aihua; Yang, Dar-Li - In: Omega 52 (2015) C, pp. 101-106

A single-machine scheduling problem with workload-dependent maintenance duration is considered. The objective is to …

Persistent link: https://www.econbiz.de/10011190632

Single-stage shunting minimizing weighted departure times

Jaehn, Florian; Rieder, Johannes; Wiehl, Andreas - In: Omega 52 (2015) C, pp. 133-141

In a traditional rail-freight hump yard, a huge number of freight cars are perpetually shunted to form outbound trains. In order to transport each car to its destination, the inbound trains are decoupled and disassembled into individual cars, which are then moved to one of the several...

Persistent link: https://www.econbiz.de/10011190641

Scheduling tool changes and special jobs on a single machine to minimize makespan

Xu, Dehua; Liu, Min; Yin, Yunqiang; Hao, Jinghua - In: Omega 41 (2013) 2, pp. 299-304

This paper considers a variation of the classical single machine scheduling problem with tool changes. In the variation … be processed within the first prefixed time units of a tool life. To solve the scheduling problem with small size and … moderate size, we propose two mathematical programming models. To solve the scheduling problem with large size, we propose …

Persistent link: https://www.econbiz.de/10010580776

Single-machine batch delivery scheduling with an assignable common due window

Yin, Yunqiang; Cheng, T.C.E.; Hsu, Chou-Jung; Wu, Chin-Chia - In: Omega 41 (2013) 2, pp. 216-225

This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due …

Persistent link: https://www.econbiz.de/10010580784