Pages that link to "Item:Q1162923"

The following pages link to A bicriterion approach to time/cost trade-offs in sequencing (Q1162923):

Displaying 50 items.

• Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
• Single machine scheduling with resource dependent release times and processing times (Q704120) (← links)
• Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← 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)
• Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
• A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• A multi-objective approach to resource allocation in single machine scheduling (Q1173857) (← links)
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis (Q1186948) (← links)
• Use of variable range in solving multiple criteria scheduling problems (Q1200841) (← links)
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem (Q1262204) (← links)
• Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs (Q1288216) (← links)
• Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091) (← links)
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times (Q1319563) (← links)
• Two machine open shop scheduling problems with bi-criteria (Q1331894) (← links)
• An interactive procedure for bi-criteria production scheduling (Q1332798) (← links)
• Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988) (← links)
• Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
• Single machine scheduling with a variable common due date and resource-dependent processing times. (Q1413814) (← links)
• Single machine batch scheduling with jointly compressible setup and processing times. (Q1417506) (← 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)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time (Q1772970) (← links)
• Scheduling unit processing time jobs on a single machine with multiple criteria (Q1823849) (← links)
• Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
• An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103) (← 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)
• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times (Q1917233) (← links)
• Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
• A tabu-search heuristic for the flexible-resource flow shop scheduling problem (Q2367002) (← links)
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach (Q2371348) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Single machine scheduling with controllable release and processing parameters (Q2433805) (← links)
• Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine (Q2434305) (← links)
• Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time (Q2448135) (← links)
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates (Q2489138) (← links)