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 and Sotirios Theofanis
Additional contact information
Mihalis M. Golias: University of Memphis, USA
Georgios K. D. Saharidis: Kathikas Institute of Research & Technology, Cyprus
Maria Boile: Rutgers University, USA
Sotirios Theofanis: Rutgers University, USA

International Journal of Information Systems and Supply Chain Management (IJISSCM), 2012, vol. 5, issue 1, 20-37

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.

Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 18/jisscm.2012010102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jisscm:v:5:y:2012:i:1:p:20-37

Access Statistics for this article

International Journal of Information Systems and Supply Chain Management (IJISSCM) is currently edited by John Wang

More articles in International Journal of Information Systems and Supply Chain Management (IJISSCM) from IGI Global
Bibliographic data for series maintained by Journal Editor ().