SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE

DOI10.1142/S0217595911003478zbMath1228.90037MaRDI QIDQ3103656

Shi-Sheng Li

Publication date: 8 December 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingdeteriorating jobsopen shopFPTASnon-bottleneck machine

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Triage Scheduling Optimization for Mass Casualty and Disaster Response ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Time-dependent scheduling
• Scheduling jobs under simple linear deterioration
• Complexity analysis of job-shop scheduling with deteriorating jobs
• An open shop scheduling problem with a non-bottleneck machine
• A concise survey of scheduling with time-dependent processing times
• Scheduling with time dependent processing times: Review and extensions
• Algorithms for Scheduling Independent Tasks
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling deteriorating jobs to minimize makespan
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Scheduling

This page was built for publication: SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE