One machine scheduling problem with fuzzy duedates
From MaRDI portal
Publication:1342032
DOI10.1016/0377-2217(94)90391-3zbMath0816.90082OpenAlexW2015401610MaRDI QIDQ1342032
Sangsu Han, Susumu Fujii, Hiroaki Ishii
Publication date: 11 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90391-3
polynomial time algorithmcontrollable machine speedfuzzy duedategeneralized one machine maximum lateness
Related Items
SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM, Parallel machine scheduling models with fuzzy processing times, The EDD rule for fuzzy job time, Optimal fuzzy counterparts of scheduling rules, Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters., Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem, FMS scheduling based on timed Petri net model and reactive graph search, Fuzzy job shop scheduling with lot-sizing, Single machine scheduling with nonlinear lateness cost functions and fuzzy due dates, A possibilistic approach to sequencing problems with fuzzy parameters, One machine scheduling problem with fuzzy random due-dates, Survey on fuzzy shop scheduling, Scheduling arrivals to a production system in a fuzzy environment, A single-machine group schedule with fuzzy setup and processing times, The single machine ready time scheduling problem with fuzzy processing times, Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date, On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
Cites Work
- Unnamed Item
- Unnamed Item
- A two-machine flow shop scheduling problem with controllable job processing times
- Two machine mixed shop scheduling problem with controllable machine speeds
- A Generalized Uniform Processor System
- TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
- Combinatorial Optimization with Rational Objective Functions
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Some simple scheduling algorithms