Single machine flow-time scheduling with a single breakdown

Two Machine Scheduling under Disruptions with Transportation Considerations

Journal of Scheduling

Stochastic Scheduling With Asymmetric Earliness And Tardiness Penalties Under Random Machine Breakdowns

Probability in the Engineering and Informational Sciences

Improved algorithms for two single machine scheduling problems

Theoretical Computer Science - Algorithmic applications in management

Scheduling with tool changes to minimize total completion time under controllable machining conditions

Computers and Operations Research

Scheduling for stability in single-machine production systems

Journal of Scheduling

Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

Computers and Operations Research

Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Computers and Industrial Engineering

Integrated production planning and preventive maintenance in deteriorating production systems

Information Sciences: an International Journal

Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic

International Journal of Computer Integrated Manufacturing - Industrial Engineering and Systems Management

Exponential inapproximability and FPTAS for scheduling with availability constraints

Theoretical Computer Science

Short Communication: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Computers and Industrial Engineering

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Algorithmics of Large and Complex Networks

Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information

Operations Research

An anticipative scheduling approach with controllable processing times

Computers and Operations Research

Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

Computers & Mathematics with Applications

A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering

Scheduling preempt-repeat version jobs on a machine subject to stochastic breakdowns to minimize quadratic earliness-tardiness penalties (I)

CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 2

Minimizing total completion time on a single machine with a flexible maintenance activity

Computers and Operations Research

Approximation schemes for scheduling with availability constraints

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

Journal of Scheduling

Approximation schemes for parallel machine scheduling with availability constraints

Discrete Applied Mathematics

Single machine scheduling with an operator non-availability period to minimize total completion time

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

Computers & Mathematics with Applications

Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

Computers and Operations Research

Improved algorithms for two single machine scheduling problems

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management

Hybrid genetic algorithm for the flexible job-shop problem under maintenance constraints

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III

Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times

Computers and Industrial Engineering

Universal sequencing on a single machine

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Single machine scheduling under potential disruption

Operations Research Letters

Minimizing makespan on a single machine subject to random breakdowns

Operations Research Letters

Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

The complexity of machine scheduling for stability with a single disrupted job

Operations Research Letters

Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints

Computers & Mathematics with Applications

Appointment Scheduling Under Patient No-Shows and Service Interruptions

Manufacturing & Service Operations Management

Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint

Computers and Industrial Engineering

Minimizing total weighted completion time with an unexpected machine unavailable interval

Journal of Scheduling