Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
DOI10.22111/IJFS.2018.4371zbMATH Open1417.90080OpenAlexW2793840273MaRDI QIDQ4626601FDOQ4626601
Authors: Jinquan Li, Dehua Xu, Hongxing Li
Publication date: 28 February 2019
Full work available at URL: http://ijfs.usb.ac.ir/article_4371_f8b14d686fb69693683e2e6e095379da.pdf
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
fuzzy numberprecedence constraintscontrollable processing timesfuzzy schedulingdue date assignment schedulingpossibilistic mean value and variance
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- A survey of scheduling with controllable processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- On possibilistic mean value and variance of fuzzy numbers
- On weighted possibilistic mean and variance of fuzzy numbers
- Structure of a simple scheduling polyhedron
- Two due date assignment problems in scheduling a single machine
- 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
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times
- Due dates assignment and JIT scheduling with equal-size jobs
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Minimizing earliness and tardiness costs in stochastic scheduling
- Title not available (Why is that?)
- Design and analysis of approximation algorithms
- Single Machine Job Sequencing with Precedence Constraints
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
Cited In (5)
- A weighted model and its algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
- 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
- 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
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)