Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
From MaRDI portal
(Redirected from Publication:4626601)
Recommendations
- Assignment scheduling problem with precedence constraints and un-symmetrical fuzzy processing times
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
- scientific article; zbMATH DE number 1539051
Cites work
- A survey of scheduling with controllable processing times
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Design and analysis of approximation algorithms
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Due dates assignment and JIT scheduling with equal-size jobs
- Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times
- scientific article; zbMATH DE number 2194036 (Why is no real title available?)
- Minimizing earliness and tardiness costs in stochastic scheduling
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- On possibilistic mean value and variance of fuzzy numbers
- On weighted possibilistic mean and variance of fuzzy numbers
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Setting due dates in a stochastic single machine environment
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- Single Machine Job Sequencing with Precedence Constraints
- Structure of a simple scheduling polyhedron
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Two due date assignment problems in scheduling a single machine
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
Cited in
(5)- Single machine, scheduling problem with fuzzy precedence relation
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
- Assignment scheduling problem with precedence constraints and un-symmetrical fuzzy processing times
- A weighted model and its algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
This page was built for publication: Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626601)
