Pages that link to "Item:Q4205229"

The following pages link to Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy (Q4205229):

Displaying 37 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
• Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
• Bicriteria robotic cell scheduling (Q835626) (← links)
• Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
• A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• A multi-objective approach to resource allocation in single machine scheduling (Q1173857) (← links)
• Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091) (← links)
• An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
• Two parallel machine sequencing problems involving controllable job processing times (Q1310019) (← links)
• Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
• A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process (Q1341405) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• An experimental analysis of solution performance in a resource sharing and scheduling problem (Q1776960) (← links)
• Convex resource allocation for minimizing the makespan in a single machine with job release dates (Q1881652) (← links)
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine (Q1885985) (← links)
• Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← links)
• Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
• A tabu-search heuristic for the flexible-resource flow shop scheduling problem (Q2367002) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
• Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
• Single machine common flow allowance scheduling with controllable processing times (Q2504094) (← links)
• The fixed-charge shortest-path problem (Q2815469) (← links)
• Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect (Q2954339) (← links)
• Scheduling with controllable processing times and compression costs using population-based heuristics (Q3168916) (← links)
• Single CNC machine scheduling with controllable processing times and multiple due dates (Q3605428) (← links)
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times (Q4495504) (← links)
• (Q4793089) (← links)
• (Q4927593) (← links)
• Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity (Q5744000) (← links)
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)