The job shop scheduling problem (JSSP) has attracted much attention in the field of both information sciences and operations research. In terms of the objective function, most existing research has been focused on the makespan criterion (i.e., minimizing the overall completion time). However,...

This paper studies a newsvendor game in which two substitutable products are sold by two different retailers (newsvendors) with loss-averse preferences. Each loss-averse retailer facing stochastic customer demand and deterministic substitution rate will make an order quantity decision to...

In this paper, we focus on the relationship between operations-based variables (specifically, production speed, scrap rate and maintenance speed) and the manufacturing cost. These variables usually produce opposite influences on the variable cost and the fixed cost. For example, setting the...

This paper studies a job shop scheduling problem with two new objective functions based on the setup and synergy costs besides the traditional total weighted tardiness criterion. The background is found in the real-world situation of a commercial vehicle producer, where the reduction of...

Strong uncertainties is a key challenge for the application of scheduling algorithms in real-world production environments, since the optimized schedule at a time often turns to be deteriorated or even infeasible during its execution due to a large majority of unexpected events. This paper...