Pages that link to "Item:Q1104846"

The following pages link to A two-machine flow shop scheduling problem with controllable job processing times (Q1104846):

Displaying 37 items.

• Scheduling under linear constraints (Q323163) (← links)
• Two-machine flowshop scheduling with flexible operations and controllable processing times (Q340278) (← links)
• Synchronous flow shop scheduling with pliable jobs (Q723997) (← links)
• Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
• A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
• Two machine flow shop scheduling problem with weighted WIP costs (Q954049) (← links)
• Flow shops with WIP and value added costs (Q969753) (← links)
• A search method for optimal control of a flow shop system of traditional machines (Q976446) (← links)
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis (Q1186948) (← links)
• Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091) (← links)
• Two parallel machine sequencing problems involving controllable job processing times (Q1310019) (← 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)
• One machine scheduling problem with fuzzy duedates (Q1342032) (← links)
• Notes on max flow time minimization with controllable processing times (Q1422222) (← links)
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337) (← links)
• Flow shop scheduling with flexible processing times (Q1621840) (← links)
• Minimizing completion time variance with compressible processing times (Q1781972) (← links)
• A 2-machine sequencing problem with machine repetition and overlapping processing times (Q1808729) (← links)
• Proportionate flow shop with controllable processing times (Q1964482) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
• Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• Two-stage production scheduling with an outsourcing option (Q2275802) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Two-machine open shop problem with controllable processing times (Q2467128) (← links)
• Scheduling a two-stage flowshop under makespan constraint (Q2476691) (← links)
• Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
• Single machine scheduling with common due date and controllable processing times (Q2489364) (← links)
• Single machine common flow allowance scheduling with controllable processing times (Q2504094) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases (Q2757616) (← links)
• A controlable two-machine flowshop scheduling problem (Q2916936) (← links)
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates (Q3705209) (← links)
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times (Q4495504) (← links)
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time (Q4732296) (← links)