Multi-machine scheduling with interval constrained position-dependent processing times
From MaRDI portal
Publication:1716992
DOI10.3934/jimo.2017076zbMath1412.90060OpenAlexW2757207648MaRDI QIDQ1716992
Peng Zhou, Dar-Li Yang, Xian-Yu Yu, De-Qun Zhou
Publication date: 5 February 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2017076
Cites Work
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
- Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
- Scheduling with job-dependent learning effects and multiple rate-modifying activities
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
- Scheduling linear deteriorating jobs with rejection on a single machine
- Single-machine scheduling with learning considerations
- Single machine scheduling with aging effect and upper-bounded actual processing times
- Scheduling with general job-dependent learning curves.
- Multi-machine scheduling with general position-based deterioration to minimize total load revisited
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
- A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
- Algorithms for the Assignment and Transportation Problems
- Scheduling Deteriorating Jobs on a Single Processor
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Algorithms for Scheduling Independent Tasks
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Techniques for scheduling with rejection
- Bounds for Certain Multiprocessing Anomalies
- An extension of the Munkres algorithm for the assignment problem to rectangular matrices
This page was built for publication: Multi-machine scheduling with interval constrained position-dependent processing times
