Baidu
map
筛选条件 共查询到31条结果
排序方式
Scheduling with gaps: new models and algorithms

期刊: JOURNAL OF SCHEDULING, 2021; 24 (4)

We consider scheduling problems for unit jobs with release times, where the number or size of the gaps in the schedule is taken into consideration, ei......

A note on the complexity of two supply chain scheduling problems

期刊: JOURNAL OF SCHEDULING, 2021; 24 (4)

We consider two supply chain scheduling problems in which s suppliers preprocess different parts of the jobs to be assembled by the manufacturer under......

A new LP rounding algorithm for the active time problem

期刊: JOURNAL OF SCHEDULING, ; ()

In this paper, we work on the scheduling problem with active time model. We have a set of preemptive jobs with integral release times, deadlines and r......

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

期刊: JOURNAL OF SCHEDULING, ; ()

We study several two-machine shop scheduling problems, namely flow shop, job shop and open shop scheduling problems under linear constraints. In these......

Scheduling on a graph with release times

期刊: JOURNAL OF SCHEDULING, ; ()

We study a generalization of the well-known traveling salesman problem in a metric space, in which each city is associated with a release time. The sa......

Single-machine scheduling with multi-agents to minimize total weighted late work

期刊: JOURNAL OF SCHEDULING, 2020; 23 (4)

We consider the competitive multi-agent scheduling problem on a single machine, where each agent's cost function is to minimize its total weighted lat......

Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing

期刊: JOURNAL OF SCHEDULING, 2020; 23 (6)

This paper investigates an integrated production and assembly scheduling problem with the practical manufacturing features of serial batching and the ......

Serial-batching scheduling with two agents to minimize makespan and maximum cost

期刊: JOURNAL OF SCHEDULING, 2020; 23 (5)

This paper considers three serial-batching scheduling problems with two agents to minimize the makespan of agent A and maximum cost (or maximum latene......

Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection

期刊: JOURNAL OF SCHEDULING, 2020; 23 (5)

In this paper we study a single batch-processing machine scheduling model. In our model, a set of jobs having different release dates needs to be sche......

Mixed batch scheduling on identical machines

期刊: JOURNAL OF SCHEDULING, 2020; 23 (4)

This paper studies a new mixed batch scheduling problem that arises in vacuum heat treatment. A mixed batch machine can process at most a given number......

Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments

期刊: JOURNAL OF SCHEDULING, 2020; 23 (5)

We study a scheduling environment that finds many real-world manufacturing applications, in which there is a close connection between a hybrid multipr......

An efficient train scheduling algorithm on a single-track railway system

期刊: JOURNAL OF SCHEDULING, 2019; 22 (1)

Since scheduling trains on a single-track railway line is an NP-hard problem, this paper proposes an efficient heuristic algorithm based on a train mo......

JIF:1.6

A note on minimizing total weighted completion time with an unexpected machine unavailable interval

期刊: JOURNAL OF SCHEDULING, 2019; 22 (2)

Recently, Huoetal.(J Sched 17(2):161-172, 2014) addressed single-machine scheduling problems with an unexpected machine unavailable interval. In their......

JIF:1.6

Online pulse interleaving task scheduling for multifunction radar

期刊: JOURNAL OF SCHEDULING, 2019; 22 (2)

An efficient scheduling algorithm is the key to handling various tasks simultaneously for the multifunction radar. A radar task comprises the transmit......

JIF:1.6

共31条页码: 1/3页15条/页
Baidu
map
Baidu
map
Baidu
map