Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals

In this paper we pf(~s(mt a reference framework and a classification of warehouse design and control problems. Based on this framework, we review the existing literature on warehousing systems and indicate important gaps. In particular, we emphasi:r.e the need for design oriented studies, a..'l opposed to the strong analysis oriented research on isolated subproblems that seems to be dominant in the current literature.

show abstract

“…Elsayed et a1. [34] and Lee and Kim [73] extend this problem with penalties for early retrieval and suggest a sequencing procedure. Han ct a1.…”

Section: Storage Policiesmentioning

confidence: 99%

Warehouse design and control: Framework and literature review

Rouwenhorst

Reuter

Stockrahm

et al. 2000

European Journal of Operational Research

470

291

View full text Add to dashboard Cite

show abstract

“…Both Elsayed et al (1993) and Elsayed and Lee (1996) discuss the batching problem with due dates in combination with the scheduling problem of orders. A penalty function has been introduced which measures both the earliness and tardiness of orders.…”

Section: Insert Figure 4 XXX Xxx Insert Table 4 Xxxmentioning

confidence: 99%

“…Models and heuristics have been proposed that intend to minimise the sum of earliness and tardiness penalties in the case that all requests or a group of requests have one common due time (e.g., Lee and Kim, 1995;Elsayed and Lee, 1996;Elsayed et al, 1993;Linn and Xie, 1993).…”

Section: Extensions Of the Basic Sequencing Problemmentioning

confidence: 99%

A survey of literature on automated storage and retrieval systems

Roodbergen

Vis

2009

European Journal of Operational Research

503

208

View full text Add to dashboard Cite

Automated Storage and Retrieval Systems (AS/RSs) are warehousing systems that are used for the storage and retrieval of products in both distribution and production environments. This paper provides an overview of literature from the past 30 years. A comprehensive explanation of the current state of the art in AS/RS design is provided for a range of issues such as system configuration, travel time estimation, storage assignment, dwell point location, and request sequencing. The majority of the reviewed models and solution methods are applicable to static scheduling and design problems only. Requirements for AS/RSs are, however, increasingly of a more dynamic nature for which new models will need to be developed to overcome large computation times and finite planning horizons, and to improve system performance. Several other avenues for future research in the design and control of AS/RSs are also specified.

show abstract

“…Hall and Posner (1991) speak of the a,-and /?,• as weights or "values," which suggests again that they could be measured on scales other than ratio scales. Many authors, for example Elsayed et al (1993), refer to a, and ft as penalties arising in connection with "just-in-time" production problems. Penalties in such problems are often measured in terms of "customer satisfaction" (see for example Auguston 1989), which certainly could be measured on any of a number of different types of scales.…”

Section: -3)mentioning

confidence: 99%

On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?

Mahadev

Pekec

Roberts

1998

Operations Research

View full text Add to dashboard Cite

We consider the problem of finding an optimal schedule for jobs on a single machine when there are penalties for both tardy and early arrivals. We point out that if attention is paid to how these penalties are measured, then a change of scale of measurement might lead to the anomalous situation where a schedule is optimal if these parameters are measured in one way, but not if they are measured in a different way that seems equally acceptable. In particular, we note that if the penalties measure utilities or disutilities, or loss of goodwill or customer satisfaction, then these kinds of anomalies can occur, for instance if we change both unit and zero point in scales measuring these penalties. We investigate situations where problems of these sorts arise for four specific penalty functions under a variety of different assumptions. The results of the paper have implications far beyond the specific scheduling problems we consider, and suggest that considerations of scale of measurement should enter into analysis of conclusions of optimality both in scheduling problems and throughout combinatorial optimization.M any practical problems involve the search for an optimal schedule. We consider the problem of scheduling n jobs on a single machine in which each job has a specified due date or completion time and a penalty is applied for a completion time different from the desired one. In many practical problems, a penalty is applied only for tardy completions; while more generally, a penalty is applied to both early and tardy completions, perhaps in a different way. The interest in scheduling problems where penalties are applied to early arrivals as well as late arrivals is closely tied to the concept of "just-in-time" production, the goal being to have "the right amount of materials of the right quality at the right time in the right place to produce the right quantity of items demanded by the next step of the production" (Cheng 1990). Because penalties can be applied to early arrivals, we allow the machine to lie idle and we schedule without preemption, i.e., we do not allow a job to be interrupted once it is started. The penalties we study involve weighting factors that weight the deviations from desired completion times.Often these weights are not uniquely determined. For instance, two weight assignments may be equally acceptable if they both give rise to the same ordering of the items or if one is related to the other by a change of scale. Typically weights are measured using some scale of measurement, and we examine the effect on the solution to a scheduling problem if we make admissible changes of scale. We show that in some cases such changes can transform an optimal solution into a nonoptimal one, and we systematically describe those situations when this anomaly occurs. More precisely, we show that the conclusion of optimality can be meaningless in a technical sense that we shall make precise. The main point of this paper is to show that considerations of scale change need to play a role in analysis of scheduli...

show abstract

Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals

Cited by 69 publications

References 13 publications

Warehouse design and control: Framework and literature review

Warehouse design and control: Framework and literature review

A survey of literature on automated storage and retrieval systems

On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?

Contact Info

Product

Resources

About