In this paper, permutation flow shops with total flowtime minimization are considered. General flowtime computing (GFC) is presented to accelerate flowtime computation. A newly generated schedule is divided into an unchanged subsequence and a changed part. GFC computes total flowtime of a...

In this paper, no-wait job shop problems with makespan minimization are considered. It is well known that these problems are strongly NP-hard. The problem is decomposed into the sequencing and the timetabling components. Shift timetabling is developed for the timetabling component. An effective...

For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves. The...

In this paper, a HGA (hybrid genetic algorithm) is proposed for permutation flowshop scheduling problems (PFSP) with total flowtime minimization, which are known to be NP-hard. One of the chromosomes in the initial population is constructed by a suitable heuristic and the others are yielded...

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...

Many real-world networks exhibit community structure where vertices belong to one or more communities. Recent studies show that community structure plays an import role in epidemic spreading. In this paper, we investigate how the extent of overlap among communities affects epidemics. In order 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...

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...