Author
Jinjiang Yuan
Bio: Jinjiang Yuan is an academic researcher from Zhengzhou University. The author has contributed to research in topics: Job shop scheduling & Scheduling (computing). The author has an hindex of 23, co-authored 137 publications receiving 1690 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This paper considers the single machine scheduling problem with release dates and rejection, shows that the problem is NP-hard in the ordinary sense, and provides two pseudo-polynomial-time algorithms that can be solved in polynomial-time.
107 citations
TL;DR: This paper shows that this problem is binary NP-hard and provides a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for the unbounded parallel batch machine scheduling with release dates and rejection.
68 citations
TL;DR: This work considers the problem of scheduling n deteriorating jobs with release dates on a single batching machine and obtains an O(n log n) dynamic programming algorithm for the unbounded model, i.e., makespan.
58 citations
TL;DR: This paper provides a fully polynomial-time approximation scheme for the makespan problem with release dates and analyzes the computational complexities of the problems for distinct objective functions and presents pseudo-polynomial-time algorithms.
55 citations
TL;DR: This work considers the bounded single-machine parallel-batch scheduling problem with release dates and rejection, and provides a 2-approximation algorithm and a polynomial-time approximation scheme for the general problem.
54 citations
Cited by
More filters
TL;DR: This paper presents a unified model representation scheme, classify existing models into several different classes, and for each class of the models give an overview of the optimality properties, computational tractability, and solution algorithms for the various problems studied in the literature.
Abstract: In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after the production. Consequently, there is little or no finished product inventory in the supply chain such that production and outbound distribution are very intimately linked and must be scheduled jointly to achieve a desired on-time delivery performance at minimum total cost. Research on integrated scheduling models of production and outbound distribution is relatively recent but is growing very rapidly. In this paper, we provide a survey of such existing models. We present a unified model representation scheme, classify existing models into several different classes, and for each class of the models give an overview of the optimality properties, computational tractability, and solution algorithms for the various problems studied in the literature. We clarify the tractability of some open problems left in the literature and some new problems by providing intractability proofs or polynomial-time exact algorithms. We also identify several problem areas and issues for future research.
477 citations
TL;DR: This paper is the third comprehensive survey paper which provides an extensive review of about 500 papers that have appeared since the mid-2006 to the end of 2014, including static, dynamic, deterministic, and stochastic environments, based on shop environments as single machine, parallel machine, flowshop, job shop, or open shop.
369 citations
TL;DR: This paper studies machine scheduling problems with explicit transportation considerations and shows that many problems are computationally difficult and proposes polynomial or pseudo-polynomial algorithms for some problems.
Abstract: In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as automated guided vehicles (AGVs) and conveyors, and finished jobs are delivered to customers or warehouses by vehicles such as trucks. Most machine scheduling models assume either that there are an infinite number of transporters for delivering jobs or that jobs are delivered instantaneously from one location to another without transportation time involved. In this paper, we study machine scheduling problems with explicit transportation considerations. Models are considered for two types of transportation situations. The first situation involves transporting a semi-finished job from one machine to another for further processing. The second appears in the environment of delivering a finished job to the customer or warehouse. Both transportation capacity and transportation times are explicitly taken into account in our models. We study this class of scheduling problems by analysing their complexity. We show that many problems are computationally difficult and propose polynomial or pseudo-polynomial algorithms for some problems. Copyright © 2001 John Wiley & Sons, Ltd.
306 citations
[...]
TL;DR: The goal of the special issue is to bring together scholars, professors, researchers, engineers and administrators resorting to the state-of-the-art technologies and ideas to significantly improve the field of Smart City based on IoT.
300 citations
TL;DR: A taxonomy and a review of this literature is presented, its contributions are cataloged, and opportunities for future research in this area are suggested.
252 citations