Similar Search Results

A note on scheduling a maintenance activity and due-window assignment based on common flow allowance

Chen, Ke; Ji, Min; Ge, Jiaojiao - In: International Journal of Production Economics 145 (2013) 2, pp. 645-646

In a recent paper [Mor, B., Mosheiov, G., 2012. Scheduling a maintenance activity and due-window assignment based on … common flow allowance. International Journal of Production Economics 135, 222–230], a scheduling problem with job …

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

A genetic algorithm for two-dimensional bin packing with due dates

Bennell, Julia A.; Soon Lee, Lai; Potts, Chris N. - In: International Journal of Production Economics 145 (2013) 2, pp. 547-560

This paper considers a new variant of the two-dimensional bin packing problem where each rectangle is assigned a due date and each bin has a fixed processing time. Hence the objective is not only to minimize the number of bins, but also to minimize the maximum lateness of the rectangles. This...

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

Optimization of automated float glass lines

Na, Byungsoo; Ahmed, Shabbir; Nemhauser, George; Sokol, Joel - In: International Journal of Production Economics 145 (2013) 2, pp. 561-572

optimization problems. These optimization problems combine aspects of traditional cutting problems and traditional scheduling and …

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

Scheduling deteriorating jobs with past-sequence-dependent delivery times

Liu, Ming; Wang, Shijin; Chu, Chengbin - In: International Journal of Production Economics 144 (2013) 2, pp. 418-421

In this note, we study parallel machine scheduling problem with past-sequence-dependent delivery times and a …

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

A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines

Gerstl, Enrique; Mosheiov, Gur - In: International Journal of Production Economics 146 (2013) 1, pp. 161-166

The decision whether to use all the available machines in the shop becomes very relevant when the capacity exceeds the demand. In such cases, it might be optimal to use only a subset of the machines. We study this option in a two-stage flowshop environment. Jobs are assumed to be identical, and...

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

On the exact bounds of SPT for scheduling on parallel machines with availability constraints

Tan, Zhiyi; Chen, Yong; Zhang, An - In: International Journal of Production Economics 146 (2013) 1, pp. 293-299

This paper considers the scheduling problems with the objective of minimizing the total completion time on two parallel …

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

Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs

Selvarajah, Esaignani; Zhang, Rui - In: International Journal of Production Economics 147 (2014) PA, pp. 117-124

In a supply chain, a manufacturer receives jobs from suppliers at distinct time points, and produces and delivers final products to customers in batches. The manufacturer can be modeled as a single machine in the supply chain and the problem can thus be modelled as minimizing the sum of weighted...

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

Scheduling problems with multiple due windows assignment and controllable processing times on a single machine

Yang, Dar-Li; Lai, Chien-Jung; Yang, Suh-Jenq - In: International Journal of Production Economics 150 (2014) C, pp. 96-103

This paper deals with multiple due windows assignment scheduling problems and controllable processing times on a single …

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

Worst case analysis of flow shop scheduling problems with a time-dependent learning effect

Li, Gang; Wang, Xiao-Yuan; Wang, Ji-Bo; Sun, Lin-Yan - In: International Journal of Production Economics 142 (2013) 1, pp. 98-104

In this paper we consider flow shop scheduling problems with a time-dependent learning effect. The time … cases of the corresponding single machine scheduling problems. We also analyze the worst-case bound of the proposed …

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

A tabu search approach for cell scheduling problem with makespan criterion

Solimanpur, Maghsud; Elmi, Atabak - In: International Journal of Production Economics 141 (2013) 2, pp. 639-645

Scheduling problem in a cellular manufacturing system is treated as the group scheduling problem, assuming that … costly and infeasible. This fact limits the applicability of group scheduling. Scheduling problem in the presence of … bottleneck machines is termed as cell scheduling. A mixed-integer linear programming model is proposed for the attempted cell …

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