2015
DOI: 10.5267/j.ijiec.2015.2.005
|View full text |Cite
|
Sign up to set email alerts
|

Integer batch scheduling problems for a single-machine with simultaneous effect of learning and forgetting to minimize total actual flow time

Abstract: This research discusses an integer batch scheduling problems for a single-machine with positiondependent batch processing time due to the simultaneous effect of learning and forgetting. The decision variables are the number of batches, batch sizes, and the sequence of the resulting batches. The objective is to minimize total actual flow time, defined as total interval time between the arrival times of parts in all respective batches and their common due date. There are two proposed algorithms to solve the prob… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
10
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7
1

Relationship

4
4

Authors

Journals

citations
Cited by 14 publications
(12 citation statements)
references
References 39 publications
1
10
0
Order By: Relevance
“…Let i th be the batch processed on the first machine with quantity Q[i11]. According to Halim and Ohta (1994), Yusriski et al (2015), Zahedi et al (2016) and Prasetyaningsih et al (2016) then in the process of batch inventory holding cost and completed batch inventory holding cost until the batch is processed on the second machine we have:…”
Section: Decision Variablesmentioning
confidence: 99%
“…Let i th be the batch processed on the first machine with quantity Q[i11]. According to Halim and Ohta (1994), Yusriski et al (2015), Zahedi et al (2016) and Prasetyaningsih et al (2016) then in the process of batch inventory holding cost and completed batch inventory holding cost until the batch is processed on the second machine we have:…”
Section: Decision Variablesmentioning
confidence: 99%
“…Obviously, the actual flowtime performance will minimise not only the length of time of the parts spend on the shop, but also meeting its due date. These criteria have been widely applied to various problems of batch scheduling (Halim, Miyazaki, and Ohta 1994;Sukoyo et al 2009;Yusriski et al 2014), but they conduct batch scheduling research on job processors that is a machine that processes the parts in a batch one by one.…”
Section: Introductionmentioning
confidence: 99%
“…Using the actual flow time as the performance measure, parts may arrive at the shop floor when they are needed instead of arriving at time zero simultaneously, and parts will be delivered to the customer at their due date (Halim & Ohta, 1993). Batch scheduling models to minimize actual flow time have been studied such as in Halim, Miyazaki and Ohta (1994) and Yusriski, Sukoyo, Samadhi and Halim (2015). The batch scheduling model in Halim et al (1994) assumed fixed processing times.…”
Section: Introductionmentioning
confidence: 99%
“…The batch scheduling model in Halim et al (1994) assumed fixed processing times. In practical situations, processing times can vary, such as from the existence of alternative operators studied in Costa, Cappadonna and Fichera (2013) and from time-changing effects of learning and forgetting studied in Jaber and Bonney (1996) and Yusriski et al (2015). Nevertheless, Costa et al (2013) and Yusriski et al (2015) only considered single-machine systems, while Jaber and Bonney (1996) have not considered batch scheduling.…”
Section: Introductionmentioning
confidence: 99%