Reference Hub9
Scheduling of Inbound Trucks at a Cross-Docking Facility: Bi-Objective VS Bi-Level Modeling Approaches

Scheduling of Inbound Trucks at a Cross-Docking Facility: Bi-Objective VS Bi-Level Modeling Approaches

Mihalis M. Golias, Georgios K. D. Saharidis, Maria Boile, Sotirios Theofanis
Copyright: © 2012 |Volume: 5 |Issue: 1 |Pages: 18
ISSN: 1935-5726|EISSN: 1935-5734|EISBN13: 9781466612778|DOI: 10.4018/jisscm.2012010102
Cite Article Cite Article

MLA

Golias, Mihalis M., et al. "Scheduling of Inbound Trucks at a Cross-Docking Facility: Bi-Objective VS Bi-Level Modeling Approaches." IJISSCM vol.5, no.1 2012: pp.20-37. http://doi.org/10.4018/jisscm.2012010102

APA

Golias, M. M., Saharidis, G. K., Boile, M., & Theofanis, S. (2012). Scheduling of Inbound Trucks at a Cross-Docking Facility: Bi-Objective VS Bi-Level Modeling Approaches. International Journal of Information Systems and Supply Chain Management (IJISSCM), 5(1), 20-37. http://doi.org/10.4018/jisscm.2012010102

Chicago

Golias, Mihalis M., et al. "Scheduling of Inbound Trucks at a Cross-Docking Facility: Bi-Objective VS Bi-Level Modeling Approaches," International Journal of Information Systems and Supply Chain Management (IJISSCM) 5, no.1: 20-37. http://doi.org/10.4018/jisscm.2012010102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper examines the problem of scheduling of inbound trucks to the inbound doors at a cross-docking facility. The authors optimize for two conflicting objectives: minimize the total service time for all the inbound trucks and minimize the delayed completion of service for a subset of the inbound trucks, which are considered as preferential customers. The problem is formulated as a bi-objective and as a bi-level mixed integer problem. Due to the nature of the former and the complexity of the latter formulation, a genetic algorithm and a k-th best based algorithm are proposed as the solution approaches. Computational examples are used to discuss the advantages and drawbacks of each formulation.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.