期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 133 ()
Batch scheduling involves a machine that can process several jobs simultaneously. The existing literature mainly focuses on the batch-size-dependent s......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 132 ()
By considering the market competition among retailers, the object of this study is to measure the bullwhip effect in a two-stage supply chain with one......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 136 ()
In this study, we consider an integrated production and transportation scheduling problem faced by make-to-order manufacturers that adopt a commit-to-......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 131 ()
Integration of process planning and scheduling (IPPS) is to carry out both functions simultaneously. This paper provides a graph-based constraint prog......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 135 ()
Putting the parts-to-picker idea into practice, the robotic mobile fulfillment system (RMFS) deploys robots to bring racks to stationary pickers so th......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 135 ()
We investigate the train timetabling problem in suburban rail transit lines by considering (1) the traditional stopping mode (TSM), in which all train......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 131 ()
This study considers a two-echelon supply chain that is comprised of an outside vendor, multiple distribution centers (DCs), and multiple retailers. T......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 131 ()
In this paper, we study the rail transit disruption recovery problem under uncertainty, considering features of public transit network and commuters' ......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 132 ()
With the advent of industry-4.0 era, industrial production are evolving towards high flexibility, diversity, customisation, and dynamism. We address a......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 134 ()
The vehicle routing problem with an incompatible loading constraint and splitting deliveries by order is an extension of the well-known capacitated ve......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 136 ()
We consider the problem of jointly optimizing train stop plan and timetable for a set of trains on a railway corridor, with focus on time-dependent pa......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 134 ()
The capacitated clustering problem (CCP) is a general model relevant for a variety of important applications in areas such as parallel computing and v......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 134 ()
When there is no further potential to be gained from technological upgrading, it is crucial for coal-fired power plants to effectively utilize their i......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 136 ()
The distributed shop scheduling has gained a great deal of attention due to its high-efficient collaboration and production. This paper studies a dist......
期刊： COMPUTERS & OPERATIONS RESEARCH, 2021; 134 ()
Extended technical precedence constraints (ETPC) in dynamic job shop scheduling problem (DJSP) are the precedence constraints existing between differe......
