Showing 1 - 10 of 34
Persistent link: https://www.econbiz.de/10012084220
This paper considers a batch delivery scheduling problem in which n independent and simultaneously available jobs are to be processed on m unrelated or uniform parallel machines. The jobs scheduled on the same machine are delivered in batches to customers and the delivery date of a batch equals...
Persistent link: https://www.econbiz.de/10011099485
Scheduling with learning effects has received lots of research attention lately. However, the multiple-agent setting with learning consideration is relatively limited. On the other hand, the actual processing time of a job under an uncontrolled learning effect will drop to zero precipitously as...
Persistent link: https://www.econbiz.de/10011099486
This paper investigates some single-machine scheduling problems with a general learning effect and the group technology assumption. A setup time is incurred whenever the single machine transfers job processing from a family to another family. By the general learning effect, we mean that the...
Persistent link: https://www.econbiz.de/10010816991
This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. There is no capacity limit on each...
Persistent link: https://www.econbiz.de/10010580784
This study investigates the impacts of telecommunications policy on productivity change of the Chunghwa Telecom Company (CHT) from pre- to post-privatization. A three-stage method is employed to measure the productivity scores of CHT during the period 1966–2008. The Malmquist productivity...
Persistent link: https://www.econbiz.de/10010943117
In this paper, we investigate a single-machine problem with the learning effect and release times where the objective is to minimize the makespan. A branch-and-bound algorithm incorporating with several dominance properties and lower bounds is developed to derive the optimal solution. A...
Persistent link: https://www.econbiz.de/10008521597
Scheduling with deteriorating jobs has received increasing attention in recent years. Moreover, the machines are assumed to have unlimited intermediate buffers. In this paper, we study the two-machine deteriorating jobs flowshop problem with blocking where the objective is to minimize the...
Persistent link: https://www.econbiz.de/10008523133
Persistent link: https://www.econbiz.de/10005339857
The concept of learning process plays a key role in production environments. However, it is relatively unexplored in the flowshop setting. In this short note, we consider a permutation flowshop scheduling problem with a learning effect where the objective is to minimize the sum of completion...
Persistent link: https://www.econbiz.de/10005287717