https://isiarticles.com/bundles/Article/pre/pdf/7398.pdf

A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

The third comprehensive survey on scheduling problems with setup times/costs

A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Some scheduling problems with general position-dependent and time-dependent learning effects

Graphical abstractDisplay Omitted In this paper, we investigate the relationships among rough sets, soft sets and hemirings. The concept of soft rough hemirings is introduced, which is an extended notion of a rough hemiring. It is pointed out that in this paper, we first apply soft rough sets to algebraic structure-hemirings. Further, we first put forward the concepts of C-soft sets and CC-soft sets, which provide a new research idea for soft rough algebraic research. Moreover, we study roughness in hemirings with respect to MSR-approximation spaces. Some new soft rough operations over hemirings are explored. In particular, lower and upper MSR-hemirings (k-ideal and h-ideal) are investigated. Finally, we put forth an approach for multicriteria group decision making problem based on modified soft rough sets and offer an actual example.

A novel soft rough set

/pdf/scheduling-with-time-dependent-processing-times-2015-l68wbyt0pm.pdf

Scheduling with Time-Dependent Processing Times 2015

Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. There is no capacity limit on each delivery batch, and the cost per batch delivery is fixed and independent of the number of jobs in the batch. The objective is to find the optimal size and location of the window, the optimal dispatch date for each job, as well as an optimal job sequence to minimize a cost function based on earliness, tardiness, holding time, window location, window size, and batch delivery. We show that the problem can be optimally solved in O ( n 8 ) time by a dynamic programming algorithm under a reasonable assumption on the relationships among the cost parameters. A computational experiment is also conducted to evaluate the performance of the proposed algorithm. We also show that some special cases of the problem can be optimally solved by lower order algorithms.

Single-machine batch delivery scheduling with an assignable common due window

This paper addresses a single-machine scheduling problem with simultaneous consideration of due-date assignment, generalised position-dependent deteriorating jobs, and deteriorating maintenance activities. It is assumed that the actual processing time of a job is a general non-decreasing function depending on the number of maintenance activities performed before it and its position in a sequence. Moreover, the machine may be subject to several maintenance activities up to a limit over the scheduling horizon. The maintenance activities do not necessarily restore the machine fully to its original perfect state and the duration of a maintenance activity depends on its start time. The objective is to find jointly the optimal job sequence, maintenance frequency and maintenance positions to minimise an objective function that includes the cost of due-date assignment, the cost of discarding jobs that cannot be completed by their due dates and the earliness of the scheduled jobs under the popular CON and SLK due-...

Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities

Yunqiang Yin

Papers

Some scheduling problems with general position-dependent and time-dependent learning effects

Scheduling with Time-Dependent Processing Times 2015

Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Single-machine batch delivery scheduling with an assignable common due window

Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities