A solution framework for the multi-mode resource-constrained cross-dock scheduling problem

In this paper we propose a framework for shift-level container scheduling and resource allocation decisions at a cross-dock facility. The Multi-Mode Resource-Constrained Cross-Dock Scheduling Problem (MRCDSP) approach minimizes material flow and schedules inbound and outbound containers to dock-doors such that the total processing time is minimized subject to the resource constraints at the cross-dock. While container scheduling and resource allocation problems at cross-dock facilities have been studied previously in isolation, our work is the first to consider a complete view of cross-dock operations providing optimal container to dock-door allocation, and a makespan minimizing schedule of containers to the cross-dock. We present a comprehensive framework that includes identification of container clusters to reduce the problem size, a container-to-dock-door assignment algorithm, and a container clusters scheduling model that is solvable for practically sized problems. In a comparative numeric study based on data simulating a cross-dock facility, our approach is shown to outperform current practice, reducing the average time required for processing a set of containers by 37% and reducing the weighted-distance material traveled within the cross-dock by 45%.     

School bus routing problem: Contemporary trends and research directions

The school bus routing problem (SBRP) is a challenging operations research problem that has been studied by researchers for almost 50 years. SBRP publications address one or more operational sub-problems, including: bus stop selection, bus route generation, bus route scheduling, school bell time adjustment, and strategic transportation policy issues. This paper reviews 64 new SBRP research publications and analyzes them by sub-problem type, problem characteristics and solution approach. The impact of key SBRP characteristics (number of schools, mixed load, fleet mix, service environment, objective and constraints) are discussed and the different solution approaches to the SBRP are summarized by sub-problem type and methodology. We found in recent years, SBRP researchers are examining more complex real-world problem settings, adopting both evolutionary-based and trajectory-based metaheuristic solution approaches, and considering ridership and travel time uncertainty. This review documents recent trends in SBRP research and highlights research gaps and promising opportunities for future SBRP research.     

Satellite downlink scheduling problem: A case study

The synthetic aperture radar (SAR) technology enables satellites to efficiently acquire high quality images of the Earth surface. This generates significant communication traffic from the satellite to the ground stations, and, thus, image downlinking often becomes the bottleneck in the efficiency of the whole system. In this paper we address the downlink scheduling problem for Canada׳s Earth observing SAR satellite, RADARSAT-2. Being an applied problem, downlink scheduling is characterised with a number of constraints that make it difficult not only to optimise the schedule but even to produce a feasible solution. We propose a fast schedule generation procedure that abstracts the problem specific constraints and provides a simple interface to optimisation algorithms. By comparing empirically several standard meta-heuristics applied to the problem, we select the most suitable one and show that it is clearly superior to the approach currently in use.     

Multi-objective permutation flow shop scheduling problem: Literature review,classification and current trends

The flow shop scheduling problem is finding a sequence given n jobs with same order at m machines according to certain performance measure(s). The job can be processed on at most one machine; meanwhile one machine can process at most one job. The most common objective for this problem is makespan. However, many real-world scheduling problems are multi-objective by nature. Over the years there have been several approaches used to deal with the multi-objective flow shop scheduling problems (MOFSP). Hence, in this study, we provide a brief literature review of the contributions to MOFSP and identify areas of opportunity for future research.     

Inter-city bus scheduling under variable market share and uncertain market demands

Bus scheduling is essential to a carrier's profitability, its level of service and its competitiveness in the market. In past research most inter-city bus scheduling models have used only the projected (or average) market share and market demand, meaning that the variations in daily passenger demand that occur in actual operations are neglected. In this research, however, we do not utilize a fixed market share and market demand. Instead, passenger choice behaviors and uncertain market demands are considered. Stochastic and robust optimizations and a passenger choice model are used to develop the models. These models are formulated as a nonlinear integer program that is characterized as NP-hard. We also develop a solution algorithm to efficiently solve the models. They are tested using data from a major Taiwan inter-city bus operation. The results show the good performance of the models and the solution algorithm.     

A disaggregation problem for a multiplant,multiproduct scheduling application

Abstract

This paper discusses an integer programming technique for planning production when there are multiple plants involved in the production of a number of products and the plants are relatively close. This allows for the closing of one plant during a planning period with a shift of the mobile resources, mainly labour, to other plants. The model is introduced and then an example problem is given. Finally, there is a discussion of why this method improves upon other techniques proposed to solve this problem. Some actual case studies are cited.     

Single machine scheduling: A comparison of two solution procedures

Recent research on the single machine scheduling problem has focused on the treatment of multiple scheduling objectives. Most works have used some combination of mean flowtime, maximum tardiness, or total tardiness as scheduling criteria. Previous research has largely ignored earliness as a scheduling criterion. This paper presents a model that employs the criteria of flowtime as a measure of work-in-process (WIP) inventory and total job earliness to represent finished goods inventory. Total tardiness is used to represent customer satisfaction. The three criteria are used to form a single, weighted-sum objective function for guiding the choice of the best processing sequence. Two procedures are presented that might be used to solve this problem. The first is an enumeration scheme using bounding and dominance criteria that have been developed to aid efficient solution, and the second is a mixed integer linear programming (LP) formulation. Computational experience with the two models is also presented.     

Competitive supply chain network design: An overview of classifications,models, solution techniques and applications

Supply chain network design (SCND) determines the structure of a chain and affects its costs and performance. SCND deals with a variety of decisions such as determining number, size and location of facilities in a supply chain (SC) and may include tactical decisions (such as distribution, transportation and inventory management policies) as well as operational decisions (such as fulfilling customers demand). SCND has a voluminous literature. Most of the literature deals with a single SC and ignores the existing competitor SCs and future emerging ones. However, SCs compete together to capture more market shares. Even if there is not any competitor at the moment, SCs should be prepared for possible future competitive situation at the SCND stage. On the other hand, many competitive models assume that the supply chain network (SCN) and its structure already exist. Few research papers consider both aspects of design and competition. In this paper, we provide a review of SCND literature and highlight the effects of competitive environment on SCND. We review, classify, and introduce the major features of the proposed models in both SCND and competition literature. After investigating proposed competitive SCND models we develop a general framework for modeling the competitive SCND problems considering managerial insight and propose potential areas for future research.     

Strategic control: a problem looking for a solution

There are a number of complex issues surrounding strategic control and this article attempts to address some of the key aspects. Control as a generic concept and process is considered first. The main control elements of measurement, evaluation and feedback are equally relevant to both the short and the long term. Nevertheless specific questions or issues can vary for strategic and operational controls, and issues of particular relevance to strategic control are identified. Different types of strategic control are explored in a discussion of 'strategic momentum control' and 'strategic leap control'. The findings of some empirical research are discussed and barriers to strategic control identified. The article concludes by briefly looking at the problems associated with the use of financial measures for strategic control.     

局内动态配送车调度管理及其竞争策略

提出了动态物流配送车辆调度优化问题——配送车在一度量空间中进行服务,度量空间中的任何一节点可能在任何时间提出服务请求,要求配送车将该点处的货物运送到另一点,每一个服务请求都有一个服务期限,若在规定的时间内某一服务请求不能被满足则将被取消,在考虑装/卸货所用时间的情况下,决策者如何以局内方式确定调度策略,使配送车完成的服务请求数最多.针对该不确定性条件下的管理决策问题,给出了两种局内管理策略,并利用局内问题及竞争分析理论,给出了不同载重量下(Q=1和Q=∞)的两种策略的竞争比.     

Decomposition algorithms for the integrated process planning and scheduling problem

There are several algorithms to solve the integrated process planning and scheduling (IPPS) problem (i.e., flexible job shop scheduling with process plan flexibility) in the literature. All the existing algorithms for IPPS are heuristic-based search methods and no research has investigated the use of exact solution methods for this problem. We develop several decomposition approaches based on the logic-based Benders decomposition (LBBD) algorithm. Our LBBD algorithm allows us to partition the decision variables in the IPPS problem into two models, master-problem and sub-problem. The master-problem determines process plan and operation-machine assignment, while the sub-problem optimizes sequencing and scheduling decisions. To achieve faster convergence, we develop two relaxations for the optimal makespan objective function and incorporate them into the master-problem. We analyze the performance and further enhance the algorithm with two ideas, a Benders optimality cut based on the critical path and a faster heuristic way to solve the sub-problem. 16 standard benchmark instances available in the literature are solved to evaluate and compare the performances of our algorithms with those of the state-of-the-art methods in the literature. The proposed algorithm either results in the optimal solution or improves the best-known solutions in all the existing instances, demonstrating its superiority to the existing state-of-the-art methods in literature.     

Outpatient appointment scheduling problem considering patient selection behavior: data modeling and simulation optimization

Journal of Combinatorial Optimization - In medical outpatient services, due to patients’ imbalanced selection for doctors of different levels and for different visiting periods, inefficiency...     

The shift minimisation personnel task scheduling problem: A new hybrid approach and computational insights

Assigning scheduled tasks to a multi-skilled workforce is a known NP-complete problem with many applications in health care, services, logistics and manufacturing. Optimising the use and composition of costly and scarce resources such as staff has major implications on any organisation׳s health. The present paper introduces a new, versatile two-phase matheuristic approach to the shift minimisation personnel task scheduling problem, which considers assigning tasks to a set of multi-skilled employees, whose working times have been determined beforehand. Computational results show that the new hybrid method is capable of finding, for the first time, optimal solutions for all benchmark instances from the literature, in very limited computation time. The influence of a set of problem instance features on the performance of different algorithms is investigated in order to discover what makes particular problem instances harder than others. These insights are useful when deciding on organisational policies to better manage various operational aspects related to workforce. The empirical hardness results enable to generate hard problem instances. A set of new challenging instances is now available to the academic community.     

The multiple traveling salesman problem: an overview of formulations and solution procedures

The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling salesman problem (TSP), where more than one salesman is allowed to be used in the solution. Moreover, the characteristics of the mTSP seem more appropriate for real-life applications, and it is also possible to extend the problem to a wide variety of vehicle routing problems (VRPs) by incorporating some additional side constraints. Although there exists a wide body of the literature for the TSP and the VRP, the mTSP has not received the same amount of attention. The purpose of this survey is to review the problem and its practical applications, to highlight some formulations and to describe exact and heuristic solution procedures proposed for this problem.     

A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance

We study a single-machine scheduling model combining two competing agents and due-date assignment. The basic setting involves two agents who need to process their own sets of jobs, and compete on the use of a common processor. Our goal is to find the joint schedule that minimizes the value of the objective function of one agent, subject to an upper bound on the value of the objective function of the second agent. The scheduling measure considered in this paper is minimum total (earliness, tardiness and due-date) cost, based on common flow allowance, i.e., due-dates are defined as linear functions of the job processing times. We introduce a simple polynomial time solution for this problem (linear in the number of jobs), as well as to its extension to a multi-agent setting. We further extend the model to that of a due-window assignment based on common flow allowance.     

An integrated strategy for a production planning and warehouse layout problem: Modeling and solution approaches

We study a real-world production warehousing case, where the company always faces the challenge to find available space for its products and to manage the items in the warehouse. To resolve the problem, an integrated strategy that combines warehouse layout with the capacitated lot-sizing problem is presented, which have been traditionally treated separately in the existing literature. We develop a mixed integer linear programming model to formulate the integrated optimization problem with the objective of minimizing the total cost of production and warehouse operations. The problem with real data is a large-scale instance that is beyond the capability of optimization solvers. A novel Lagrangian relax-and-fix heuristic approach and its variants are proposed to solve the large-scale problem. The preliminary numerical results from the heuristic approaches are reported.     

Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties

In this paper, we consider the parallel-machine scheduling problem with release dates and submodular rejection penalties. In this problem, we are given m identical parallel machines and n jobs. Each job has a processing time and a release date. A job is either rejected, in which case a rejection penalty has to be paid, or accepted and processed on one of the m identical parallel machines. The objective is to minimize the sum of the makespan of the accepted jobs and the rejection penalty of the rejected jobs which is determined by a submodular function. Our main work is to design a 2-approximation algorithm based on the primal-dual framework.