SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

DOI10.22111/ijfs.2018.4371zbMath1417.90080OpenAlexW2793840273MaRDI QIDQ4626601

Jinquan Li, Dehua Xu, Hong-Xing Li

Publication date: 28 February 2019

Full work available at URL: http://ijfs.usb.ac.ir/article_4371_f8b14d686fb69693683e2e6e095379da.pdf

zbMATH Keywords

fuzzy numberprecedence constraintscontrollable processing timesfuzzy schedulingdue date assignment schedulingpossibilistic mean value and variance

Mathematics Subject Classification ID

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

• Unnamed Item
• 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
• Design and analysis of approximation algorithms
• Two due date assignment problems in scheduling a single machine
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent 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
• Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Structure of a simple scheduling polyhedron
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• On weighted possibilistic mean and variance of fuzzy numbers
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
• Minimizing earliness and tardiness costs in stochastic scheduling
• A survey of scheduling with controllable processing times
• Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
• Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
• Setting due dates in a stochastic single machine environment
• Single Machine Job Sequencing with Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• On possibilistic mean value and variance of fuzzy numbers