Scheduling families of jobs with setup times

Liaee, Mohammad Mehdi; Emmons, Hamilton

doi:10.1016/s0925-5273(96)00105-3

Cited by 60 publications

(21 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additional setup cost to switch between workstations, jobs, or products. Galvin (1987), Gascon and Leachman (1988), Sethi and Sethi (1990), Yan and Zhang (1997), Wolsey (1997), Van Oyen (1998), Inman (1999), Tsubone and Horikawa (1999), Robinson and Sahin (2001), Lahmar et al (2003), Han et al (2003), Hur et al (2003), de Matta and Miller (2004), Hajji et al (2004), Wu et al (2004), Brahimi et al (2006) Switching the production rate Hall (1988), Kim and Han (2001), Kamrad and Ernst (2001), Larsen (2005) Machine start-up/shutdown Pattloch and Schmidt (1996), Liaee and Emmons (1997), Kim and Han (2001), Khouja (2005), Sim et al (2006) Machine cleaning Kumar (1995), Wolsey (1997), Olson and Schniederjans (2000), Robinson andSahin (2001), de Matta andMiller (2004), Brahimi et al (2006) Production loss Watkins (1957), Paul et al (1980), Weber (2006 Tooling Kumar (1995), Sim et al (2006), Brahimi et al (2006) Deterioration in quality Paul et al (1980), Khouja (2005) Machine adjustment Koulamas (1993), …”

Section: Accounting For Switching (Changeover) Costsmentioning

confidence: 99%

The EOQ repair and waste disposal model with switching costs

Saadany

Jaber

2008

Computers & Industrial Engineering

View full text Add to dashboard Cite

Section: Accounting For Switching (Changeover) Costsmentioning

confidence: 99%

The EOQ repair and waste disposal model with switching costs

Saadany

Jaber

2008

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…Earlier results in this area have been reviewed in (Ham, Hitomy and Yoshida, 1985;Potts and Van Wassenhove, 1991). More recent results can be found in (Kovalyov and Tuzikov, 1994;Janiak and Kovalyov, 1995;Liaee and Emmons, 1997;Liu and Yu, 1999;Janiak, Shafransky and Tuzikov, 2001).…”

Section: Introductionmentioning

confidence: 97%

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time

Cheng

Janiak

et al. 2005

Ann Oper Res

View full text Add to dashboard Cite

The following single machine scheduling problem is studied. A partition of a set of n jobs into g groups on the basis of group technology is given. The machine processes jobs of the same group contiguously, with a sequence independent setup time preceding the processing of each group. The setup times and the job processing times are controllable through the allocation of a continuously divisible or discrete resource to them. Each job uses the same amount of the resource. Each setup also uses the same amount of resource, which may be different from that for the jobs. Polynomial-time algorithms are constructed for variants of the problem of finding an optimal job sequence and resource values so as to minimize the total weighted job completion time, subject to given restrictions on resource consumption. The algorithms are based on a polynomial enumeration of the candidates for an optimal job sequence and solving the problem with a fixed job sequence by linear programming.

show abstract

“…Ahn and Hyun (1990), Bruno and Sethi (1977), Mason and Anderson (1991), and Monma and Potts (1989) propose algorithms for minimizing total weighted flowtime on a single machine with family setup times. We refer to Webster and Baker (1995) and Liaee and Emmons (1997) for a review of scheduling literature on family scheduling problems. Further we note here that sequence-dependent setup times tend to make solutions difficult to find.…”

Section: Introductionmentioning

confidence: 99%

Family sequencing and cooperation

Grundel

Çiftçi²,

Borm

et al. 2013

European Journal of Operational Research

View full text Add to dashboard Cite

This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a so-called family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a family has an identical cost function that depends linearly on its completion time. Moreover, a job does not require a setup when preceded by another job from the same family while a family specific setup time is required when a job follows a member of some other family.Explicitly taking into account admissibility restrictions due to the presence of the initial order, we show that for any subgroup of jobs there is an optimal order, such that all jobs of the same family are processed consecutively. To analyze the allocation problem of the maximal cost savings of the whole group of jobs, we define and analyze a so-called corresponding cooperative family sequencing game which explicitly takes into account the maximal cost savings for any coalition of jobs. Using nonstandard techniques we prove that each family sequencing game has a non-empty core by showing that a particular marginal vector belongs to the core. Finally, we specifically analyze the case in which the initial order is family ordered.

show abstract

Scheduling families of jobs with setup times

Cited by 60 publications

References 17 publications

The EOQ repair and waste disposal model with switching costs

The EOQ repair and waste disposal model with switching costs

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time

Family sequencing and cooperation

Contact Info

Product

Resources

About