scispace - formally typeset
J

Jun-Qiang Wang

Researcher at Northwestern Polytechnical University

Publications -  46
Citations -  725

Jun-Qiang Wang is an academic researcher from Northwestern Polytechnical University. The author has contributed to research in topics: Job shop scheduling & Scheduling (computing). The author has an hindex of 11, co-authored 43 publications receiving 531 citations.

Papers
More filters
Journal ArticleDOI

Real-time information capturing and integration framework of the internet of manufacturing things

TL;DR: A real-time information capturing and integration architecture of the internet of manufacturing things (IoMT) is presented to provide a new paradigm by extending the techniques of IoT to manufacturing field.
Journal ArticleDOI

An optimization method for shopfloor material handling based on real-time and multi-source manufacturing data

TL;DR: A dynamical optimization model for shopfloor material handling (DOM-SMH) is designed and the key technologies such as intelligent trolley, real-time information exchange and optimization for material handling tasks are designed and developed.
Journal ArticleDOI

A cooperative approach to service booking and scheduling in cloud manufacturing

TL;DR: A cooperative game for client coordination is developed and a core cost savings allocation scheme with which every client can get benefits through coordination is proposed with results showing that this approach can make substantial cost savings for clients.
Journal ArticleDOI

Synchronisation of production scheduling and shipment in an assembly flowshop

TL;DR: In this paper, a synchronised scheduling problem of production simultaneity and shipment punctuality in a two-stage assembly flow shop system is studied, and a modified GA is proposed for solving this problem.
Journal ArticleDOI

Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan

TL;DR: This work shows that there is no polynomial-time approximation algorithm with an absolute worst-case ratio less than 2, unless P=NP, and gives a polynometric-time approximator with anabsolute worst- case ratio exactly 2.