Single machine scheduling to minimize weighted sum of completion times with secondary criterion — A branch and bound approach

Bansal, Sangeeta

doi:10.1016/0377-2217(80)90087-9

Cited by 43 publications

(6 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concerning the counting problems we were not able to establish either their com- Szwarc (1993), Kim and Yano (1994), Fry et al (1996) Fry and Leong (1986), Azizoglu et al (1991) (1984) 1 Koulamas (1996) 1 Chand and Schneeberger (1988) Fry et al (1987a), Fry and Blackstone (1988), James and Buchanan (1997), James and Buchanan (1998) 1 Yano and Kim (1991), Mazzini and Armentano (2001) 1 Ow and Morton (1988), Ow and Morton (1989), Li (1997), Almeida and Centeno (1998), Liaw (1999) 1 Chand and Schneeberger (1984), Hoogeveen (1992), Smith (1956), Bansal (1980), Chand and Schneeberger (1986), Heck and Roberts (1972), Burns (1976), …”

Section: Counting and Enumeration For Multicriteria Schedulingmentioning

confidence: 94%

Counting and enumeration complexity with application to multicriteria scheduling

t'Kindt

Bouibede-Hocine

Esswein

2005

4OR

View full text Add to dashboard Cite

show abstract

Section: Counting and Enumeration For Multicriteria Schedulingmentioning

confidence: 94%

Counting and enumeration complexity with application to multicriteria scheduling

t'Kindt

Bouibede-Hocine

Esswein

2005

4OR

View full text Add to dashboard Cite

show abstract

“…approaches for the problem are due to Bansal (1980), Pan (2003), Posner (1985), and Potts and Van Wassenhove (1983). Park and Kim (2000) also address the problem with deadlines.…”

Section: Scheduling With Due Date Objectivesmentioning

confidence: 99%

Available-to-promise (ATP) systems: a classification and framework for analysis

Framiñán

Leisten

2009

International Journal of Production Research

View full text Add to dashboard Cite

Available-To-Promise (ATP) systems deal with a number of managerial decisions related to Order Capture activities in a company, including order acceptance/rejection, due date setting, and resource scheduling. These different but interrelated decisions have been often studied in an isolated manner, and, to the best of our knowledge, no framework has been presented to integrate them into the broader perspective of Order Capture. This paper attempts to provide a general framework for ATP-related decisions. By doing so, we 1) identify the different decision problems to be addressed, 2) present the different literature-based models supporting related decisions into a coherent framework, and 3) review the main contributions in the literature for each one of these. We first describe different approaches for Order Capture available in the literature, depending on two parameters related to the application context of ATP systems, namely the inclusion of explicit information about due dates in the decision model, and the level of integration among decisions. According to these parameters, up to six approaches for ATP-related decisions are identified. Secondly, we show the subsequent decision problems derived from the different approaches, and describe the main issues and key references involving each one of these decision problems. Finally, a number of conclusions and future research lines are discussed.

show abstract

“…Ow and Morton (1988), Ow and Morton (1989), Li (1997), Almeida and Centeno (1998), Liaw (1999) 1|d #P EN P\P Chand and Schneeberger (1984), Hoogeveen (1992), Smith (1956), Bansal (1980), Chand and Schneeberger (1986), Heck and Roberts (1972), Burns (1976), Miyazaki (1981) 1|d #P EN P\P Rajendran (1992), Neppalli et al (1996), Gupta et al (2001), Gupta et al (2002), , T'kindt et al (2003), Nagar et al (1995), Serifoglu and Ulusoy (1998) #P EN P\P Gupta and Werner (1999), Kyparisis and Koulamas (2000) whatever the weights. However, it is clear that if minimising a convex combination of criteria is not a polynomial problem, then there is no opportunity for the enumeration problem to be solvable in polynomial time.…”

Section: En P\pmentioning

confidence: 99%

Counting and enumeration complexity with application to multicriteria scheduling

t'Kindt

Bouibede-Hocine²,

Esswein³

2007

Ann Oper Res

View full text Add to dashboard Cite

In this paper we tackle an important point of combinatorial optimisation: that of complexity theory when dealing with the counting or enumeration of optimal solutions. Complexity theory has been initially designed for decision problems and evolved over the years, for instance, to tackle particular features in optimisation problems. It has also evolved, more or less recently, towards the complexity of counting and enumeration problems and several complexity classes, which we review in this paper, have emerged in the literature. This kind of problems makes sense, notably, in the case of multicriteria optimisation where the aim is often to enumerate the set of the so-called Pareto optima. In the second part of this paper we review the complexity of multicriteria scheduling problems in the light of the previous complexity results.

show abstract

Single machine scheduling to minimize weighted sum of completion times with secondary criterion — A branch and bound approach

Cited by 43 publications

References 3 publications

Counting and enumeration complexity with application to multicriteria scheduling

Counting and enumeration complexity with application to multicriteria scheduling

Available-to-promise (ATP) systems: a classification and framework for analysis

Counting and enumeration complexity with application to multicriteria scheduling

Contact Info

Product

Resources

About