Related references
Note: Only part of the references are listed.Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
Imed Kacem et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2016)
Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
Yunqiang Yin et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
Imed Kacem et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2015)
Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
Yunqiang Yin et al.
INFORMATION SCIENCES (2014)
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
Imed Kacem et al.
JOURNAL OF SCHEDULING (2011)
A survey of scheduling problems with late work criteria
Malgorzata Sterna
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2011)
A single-machine scheduling problem with maintenance activities to minimize makespan
Chou-Jung Hsu et al.
APPLIED MATHEMATICS AND COMPUTATION (2010)
A survey of scheduling with deterministic machine availability constraints
Ying Ma et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2010)
Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval
Imed Kacem et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2009)
Minimizing number of tardy jobs on a single machine subject to periodic maintenance
Wen-Jinn Chen
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2009)
Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval
Imed Kacem
COMPUTERS & INDUSTRIAL ENGINEERING (2008)
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
Jacek Blazewicz et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
Worst-case analysis of the WSPT1 and MWSPT2 rules for single machine scheduling with one planned setup period
Imed Kacem et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
Joachim Breit
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
WJ Chen
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2006)
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
J Blazewicz et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2005)
The two-machine flow-shop problem with weighted late work criterion and common due date
J Blazewicz et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
C Sadfi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
An FPTAS for scheduling a two-machine flowshop with one unavailability interval
CT Ng et al.
NAVAL RESEARCH LOGISTICS (2004)
Open shop scheduling problems with late work criteria
J Blazewicz et al.
DISCRETE APPLIED MATHEMATICS (2004)
Single-machine scheduling with periodic maintenance and nonresumable jobs
CJ Liao et al.
COMPUTERS & OPERATIONS RESEARCH (2003)
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness
MY Kovalyov et al.
JOURNAL OF HEURISTICS (2002)
Share Paper
