Long Wan

From MaRDI portal
Person:391786

Available identifiers

zbMath Open wan.longMaRDI QIDQ391786

List of research outcomes





PublicationDate of PublicationType
Revisit of the scheduling problems with integrated production and delivery on parallel batching machines2021-07-05Paper
Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs2021-06-03Paper
Single-machine scheduling with operator non-availability to minimize total weighted completion time2020-09-08Paper
Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs2019-12-20Paper
Simultaneous approximation ratios for parallel machine scheduling problems2019-10-04Paper
Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost2019-03-19Paper
Online scheduling on a single machine with grouped processing times2019-02-19Paper
Two-agent scheduling to minimize the maximum cost with position-dependent jobs2019-02-19Paper
Scheduling jobs with maintenance subject to load-dependent duration on a single machine2018-08-27Paper
Online scheduling with delivery time on a bounded parallel batch machine with limited restart2018-08-27Paper
https://portal.mardi4nfdi.de/entity/Q31316292018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q53715562017-10-20Paper
Scheduling to minimize the maximum total completion time per machine2016-07-08Paper
Scheduling jobs and a variable maintenance on a single machine with common due-window assignment2016-06-30Paper
https://portal.mardi4nfdi.de/entity/Q34629192016-01-15Paper
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints2015-07-28Paper
https://portal.mardi4nfdi.de/entity/Q52603072015-06-29Paper
A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect2015-06-12Paper
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan2015-02-24Paper
A note on a fully polynomial-time approximation scheme for minimizing makespan of deteriorating jobs2014-11-24Paper
A competitive two-agent scheduling problem on parallel machines with release dates and preemption2014-10-13Paper
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard2014-05-14Paper
Inefficiency of Nash equilibria with parallel processing policy2014-04-11Paper
https://portal.mardi4nfdi.de/entity/Q53999782014-02-28Paper
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines2014-01-13Paper
Inefficiency of equilibria for the machine covering game on uniform machines2012-10-15Paper

Research outcomes over time

This page was built for person: Long Wan