Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date
DOI10.1007/S10700-004-5870-9zbMATH Open1082.90036OpenAlexW2002301261MaRDI QIDQ812435FDOQ812435
Hiroaki Ishii, Kanthen K. Harikrishnan
Publication date: 23 January 2006
Published in: Fuzzy Optimization and Decision Making (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10700-004-5870-9
Recommendations
- Single machine batch scheduling with resource dependent setup and processing times
- Batch scheduling problem with due-date and fuzzy precedence relation
- Single machine batch scheduling with jointly compressible setup and processing times.
- Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times
- Single machine batch scheduling with deadlines and resource dependent processing times
linear programmingresource allocationschedulingbatchingbi-criteriafuzzy due-dateminimum satisfaction degree
Theory of fuzzy sets, etc. (03E72) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling with batching: A review
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Batching to Minimize Flow Times on One Machine
- Single machine batch scheduling with resource dependent setup and processing times
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- One-pass batching algorithms for the one-machine problem
- A polynomial algorithm for a one machine batching problem
- Single machine batch scheduling with deadlines and resource dependent processing times
- One machine scheduling problem with fuzzy duedates
Cited In (6)
- USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- Single machine scheduling problem with interval processing times and total completion time objective
- USING GENETIC ALGORITHMS TO SOLVE FUZZY FLOW SHOP SCHEDULING PROBLEMS BASED ON POSSIBILITY AND NECESSITY MEASURES
- Survey on fuzzy shop scheduling
- 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 batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812435)