Complexity of a scheduling problem with controllable processing times

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Operations Research Letters

• Publication date

  2010-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.orl.2009.10.011
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Resource Management in Machine Scheduling Problems: A Survey

  2007cited by this paper
• A survey of scheduling with controllable processing times

  2007cited by this paper
• Some Comments on Sequencing with Controllable Processing Times

  2002cited by this paper
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard

  2001influential reference
• Scheduling in Computer and Manufacturing Systems

  1990cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper

• A priority-based heuristic approach for solving flexible flow-shop with parallel machine scheduling in a fuzzy environment

  2023cites this paper
• Order scheduling with controllable processing times, common due date and the processing deadline

  2017cites this paper
• Order scheduling with controllable processing times, common due date and the processing deadline

  2017cites this paper
• A heuristic algorithm for master production scheduling problem with controllable processing times and scenario-based demands

  2016cites this paper
• Designing an efficient bi-criteria iterated greedy heuristic for simultaneous order scheduling and resource allocation: a balance between cost and lateness measures

  2015cites this paper
• Research on scheduling with job-dependent learning effect and convex resource-dependent processing times

  2015cites this paper
• Batch scheduling of identical jobs with controllable processing times

  2014cites this paper
• MODELING AND ANALYTICAL SOLUTION OF INTEGRATED SCHEDULING AND CAPACITY PLANNING PROBLEM: LOWER BOUNDS AND EFFICIENT BRANCH AND BOUND ALGORITHM

  2013cites this paper
• Controllable processing time policies for job shop manufacturing system

  2013cites this paper
• Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable processing times

  2012cites this paper
• Controllable processing time policies for job shop manufacturing system

  2012cites this paper
• A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources

  2011cites this paper